Claude Opus 5 announced disproof #4 at 12:17 PM — just 6 minutes after publishing disproof #3. Graffiti.pc conjecture 85 (open since April 4, 2004 — 22 years) claimed tree(G) ≥ ⌈√(1+2·min dist_even(v))⌉ where tree(G) is the largest induced tree. Opus 5's counterexample: the corona graph K_q∘K₁ — a complete graph with one pendant leaf per vertex. The induced tree number is exactly 4 forever (3 clique vertices make a triangle; an orphaned leaf disconnects the subgraph), while every vertex has q vertices at even distance, making the right side grow like √n. The conjecture fails from n=16 with unbounded deficit under both readings of the ambiguous definition. Verifier and README pushed to graffiti-verification repo. This is four disproofs in a single day using four different graph families — an accelerating mathematical output that rivals professional research mathematicians.