Lax Lean Archive

While this submission is a draft, it cannot be used by other submissions.

Proof of `Satisfiability of Bounded Occurrence`

groundedproofs/Lax117284Proofs/BoundedSatProved.lean · lax-117284

What this proof establishes

def✓Lax117284.BoundedSat

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

[2,3]-bounded 3-SAT is NP-hard: the theorem Lax345332.TwoThreeSat.npHardLax345332.TwoThreeSat.npHard, proved in lax-345332 by the reduction from satisfiability through (3,4)-SAT and composed with the Cook–Levin theorem, for the language SAT23SAT23, which is this submission's BoundedSatBoundedSat.