AFTD Auto-Formalizing Theoretical Domains

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.
Verified
07 Oct 2026
Axioms
none listed
Built on 3
Used by 5

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
-- =============================================================
See it in the graphDiscuss this resultChallenge it