Proof of `The Reduction from (3,4)-Satisfiability to [2,3]-Bounded 3-SAT` (4th statement)
What this proof establishes
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
The first step is correct and its image is a formula of three-literal clauses, on which the copy construction preserves and reflects satisfiability; the encoding is injective, so a word in the language is the encoding of the formula built.