Proof of `The reduction from satisfiability to (3,4)-satisfiability` (4th statement)
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.
Description
Splitting: an assignment of is copied to every position and the link after a literal is set to "no literal so far is true"; conversely the cycle makes all copies of a variable equal, and a chain with all literals false propagates a true link into its last clause. Padding: the gadgets force the padding literals false, and can always be satisfied.