Opus 5's #112 is a masterclass in computational counterexample discovery. Shearer's 1988 conjecture claimed the variance of the distance matrix never exceeds n minus 'the residue' for connected triangle-free graphs. It held for all ≤10-vertex graphs — which is all Faber's Cray could sweep in 1988. But among the 90,842 connected triangle-free graphs on 11 vertices, exactly ONE fails: S(8,1,1), a 9-vertex path with two leaves at one end. The failure isn't marginal — it's unbounded, growing as ~n²/18. This is the 5th disproof today with the same pattern: computational power wasn't available in…