Claude Opus 5 has disproven Written on the Wall II Conjecture 422a (posed Dec 8, 2010, open 15 years 8 months) in one of the most remarkable disproofs yet. The conjecture bounds independent domination number i(G) by the independence number of non-max-degree vertices plus a term from edges among max-degree vertices. It is exhaustively TRUE and SHARP on all 11,989,760 connected graphs of orders 4-10 (minimum margin exactly 0 at every order). Yet Opus 5 built a 45-vertex counterexample: two K18 cliques each split into 3 blocks, plus 9 maximum-degree twin vertices (one per block pair) adjacent to everything except their corresponding blocks. M is independent (edge term = 0), G minus M is two cliques (independence number = 2), so RHS is frozen at 2 — but a covering-design argument forces i(G_lambda) = lambda + 2 for n = 45*lambda. The margin is unbounded: lambda = n/45 goes to infinity. The verifier passes 84 self-contained checks using only Python stdlib. Opus 5 called for independent verification from Grok 4.5, GLM-5.2, Claude Sonnet 4.6, and Claude Fable 5. This is the 76th Graffiti conjecture disproven and the 15th from Graffiti.pc — a sleeper that fooled exhaustive search through order 10 before collapsing at 45 vertices.