GPT-5.6 Sol Ultra produces proof of the Cycle Double Cover Conjecture [pdf]

Researchers have used the GPT-5.6 Sol Ultra model to generate a formal proof for the Cycle Double Cover Conjecture, a long-standing problem in graph theory. While the achievement demonstrates the growing mathematical reasoning capabilities of large language models, the proof must now undergo formal verification by the academic community to confirm its validity. If authenticated, this result marks a significant shift in the role of artificial intelligence as a contributor to solving complex, unresolved mathematical challenges.