Proof of `A bounded satisfying assignment`
groundedproofs/Lax429075Proofs/Certificates.lean · lax-429075
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 2 of this submission's paper
Description
Restrict a satisfying assignment to the input-length prefix containing every variable.