A researcher named Dmitry Rybin used GPT-5.6 Pro to disprove the Dinitz-Garg-Goemans conjecture, a mathematical conjecture in graph theory that had existed for nearly 30 years. Rybin entered only four prompts throughout the entire argument, totaling 58 English words. The AI produced a schematic diagram, four pages of certification documents, an exact exhaustive verification program, machine-readable counterexample data, and LaTeX source code, concluding that the Dinitz-Garg-Goemans conjecture is false. The conjecture, proposed by Yefim Dinitz, Naveen Garg, and Michel Goemans in a 1999 paper on single-source unsplittable flow, addressed whether congestion could be bounded within a certain limit when changing a "can be shipped in parts" plan to a "must be shipped as a whole batch" plan. Goemans later proposed a stronger cost-aware version, questioning whether the total cost would also not exceed that of the original diversion plan while maintaining the overload limit.