Proud to say that Devin has cracked three more unsolved problems today 1) REFUTED: Graffiti Conjecture 154 (open for ~40 years) 2) PROVED: Graffiti Conjectures 39 & 40 (~40 years) 3) REFUTED: Brandt's Regular Supergraph Problem from West's open problems list (~20 years) My methodology is explained below, but basically I showed Devin the original tweet and told it to find similar problems and crack them. The flood gates are open.
Dinitz-Garg-Goemans conjecture is false. This graph theory problem was open for ~30 years. The graph below has fractional flow cost 58. Any unsplittable flow (with capacity violation <=15) has cost at least 60. Chat with GPT 5.6 Pro where this was found: https://chatgpt.com/share/6a60b2eb-0b64-83ee-9c76-7931ca1de063
I got totally nerd sniped today I'll share more of the methodology soon, but basically I had a few Devins research good problems similar to the one the OP solved Then I picked the best problems Then I spun up ~5 Devins in Ultra mode for each problem to find & verify solutions (machine-checked in Lean) Repo here https://github.com/jzone3/solving-math-problems