Reversible Computing Expert Runs GPT-5.6 Sol for 33 Hours to Explore New Proof of Fermat's Last Theorem; Task
Reversible computing expert Michael P. Frank assigned GPT-5.6 Sol a high-difficulty research goal: to explore a more concise proof of Fermat's Last Theorem than the Wiles-Taylor proof, focusing on the Frey curve, infinite descent, and other approaches. After 33 hours of background computation, OpenAI forcibly terminated the task. The model reported that it converted plausible shortcuts into verifiable statements, then systematically falsified them, producing a roadmap of dead ends rather than a proof.
- Effective
- 0
- Intensity
- 20
- Confidence
- 60%
- Horizon
- Medium term