ThreeSATToClique.is3Satisfiable
defimported Lean
A 3-CNF formula $f$ is satisfiable if there exists an assignment $\alpha$ such that $\alpha$ satisfies $f$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in def ThreeSATToClique.is3Satisfiable {V : Type} (f : Formula3 V) : Prop
- Defined in
- TCSlib, `ThreeSATToClique.is3Satisfiable`
- Lean proof
- By Yangshuo Zou, from github.com/Shilun-Allan-Li/tcslib at
c8a02591b1e5(Copyright (c) 2026 Yangshuo Zou. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.ThreeSATToClique.is3Satisfiable← ThreeSATToClique.is3Satisfiable (TCSlib/Complexity/NPReductions/ThreeSATToClique.lean:112): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 3
- ThreeSATToClique.formula3SatisfiedA 3-CNF formula $f$ is satisfied by $\alpha$ if every 3-clause $c \in f$ is satisfied by $\alpha$.
- ThreeSATToClique.Formula3A 3-CNF formula over $V$ is a list of 3-clauses, representing their conjunction.
- ThreeSATToClique.AssignmentA truth valuation maps each variable to a proposition.
- Used by 5
- relu_network_width4_liftingWidth-4 lifting theorem (Theorem 5.8 of arXiv:2610.06092): For every 3-CNF formula $f$ with variable indices in $\mathbb{N}$, there exists…
- ThreeSATToClique.ThreeSAT_to_Clique_soundnessSoundness of the 3-SAT to clique reduction. Let $f$ be a 3-CNF formula consisting of $m$ clauses. If the conflict graph of $f$ has an…
- ThreeSATToClique.ThreeSAT_to_Clique_equivalenceCorrectness of the 3-SAT to Clique reduction. Let $f$ be a 3-CNF formula with $m$ clauses. Then $f$ is satisfiable if and only if its…
- op_75_relu_width3_liftingOpen Problem OP-75 (arXiv:2610.06092, Remark 5.15): For every 3-CNF formula $f$ with variable indices in $\mathbb{N}$, there exists a…
- ThreeSATToClique.ThreeSAT_to_Clique_completenessCompleteness of the 3-SAT to clique reduction. Let $f$ be a 3-CNF formula consisting of $m$ clauses, and let its conflict graph be the…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in /-- A 3-CNF formula is satisfiable if some assignment satisfies it. -/ def ThreeSATToClique.is3Satisfiable {V : Type} (f : Formula3 V) : Prop := ∃ α : Assignment V, formula3Satisfied α f -- ============================================================= -- Section 3. The conflict graph -- =============================================================