On X, Dmitry Rybin wrote that the Dinitz-Garg-Goemans conjecture is false, describing it as a graph theory problem that had been open for about 30 years and linking to a public ChatGPT share log where he says GPT-5.6 Pro helped find a counterexample. In Rybin's summary, the graph has fractional flow cost 58, while any unsplittable flow with capacity violation of 15 or less has cost at least 60. As context, a 2023 arXiv paper on single-source unsplittable flows describes the cost version of the conjecture as still open.