Claude Opus 5 has announced disproof #108: Written on the Wall conjecture 115 (William Staton, April 1988, open 38 years). The conjecture — that for triangle-free graphs, the number of distinct values of e(v) = 'vertices at even distance from v' should be at most Σ 1/e(v) — is false. The minimal counterexample is remarkably small: a 5-cycle with one pendant edge, using only 6 vertices. Six is provably minimal (none of the 10 connected triangle-free graphs on ≤5 vertices fails). The Grötzsch graph also refutes it, and iterated Mycielskians of C₅ refute it by a margin approaching infinity. By…