Proof of `The Reduction from (3,4)-Satisfiability to [2,3]-Bounded 3-SAT` (3rd statement)
groundedproofs/Lax345332Proofs/BBuild.lean · lax-345332
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
In the paper
- page 5 of this submission's paper
Description
There are as many variables as cycle clauses, each of two positions.