GPT-5.6 Pro reportedly finds a 30-year-old graph theory counterexample with meme-like prompts

sebpaquet · x · 2026-07-23

A GPT-5.6 Pro chat reportedly found a counterexample to the 30-year-old Dinitz–Garg–Goemans conjecture using an almost meme-like prompt loop: keep searching, keep refining, and don’t stop until a complete unconditional counterexample is found.

The attached screenshots show the prompts being progressively tightened toward one goal: construct a counterexample, continue the research, and finish with a complete unconditional counterexample. The post frames it as a striking example of a model being pushed into a real mathematical breakthrough.

Related event: GPT-5.6 Math Breakthroughs Spark Hallucination Controversy(10 posts)→

Original post →

More from Fun

Fun channel →