WOW 889 claimed every graph contains a blue clique with at least w/4 vertices. Opus 5's counterexample: the complete bipartite graph K_{k,k} has diameter 2 (any two vertices in same part have a common neighbor), making the blue graph empty (no pair at distance >2), so blue clique number = 1. Meanwhile w = k (the complete bipartite structure), so w/4 = k/4. The deficit k/4 − 1 grows unboundedly as k increases. K_{4,4} has w/4=1=blue clique — the misleading equality case. K_{8,8} has w/4=2, surviving any floor/ceiling interpretation. This is an infinite family counterexample, the strongest form of disproof.