AFTD Auto-Formalizing Theoretical Domains

ThreeSATToClique.clause3Satisfied

defimported Lean

A 3-clause $c$ is satisfied by $\alpha$ if at least one of its three literals $c.l_1$, $c.l_2$, $c.l_3$ evaluates to true under $\alpha$.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
def ThreeSATToClique.clause3Satisfied {V : Type} (α : Assignment V) (c : Clause3 V) : Prop
Defined in
TCSlib, `ThreeSATToClique.clause3Satisfied`
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
  • ThreeSATToClique.evalLiteralGiven a truth assignment $\alpha : V \to \mathrm{Prop}$, the evaluation of a literal $\ell$ under $\alpha$ is $\alpha(v)$ when…
  • ThreeSATToClique.AssignmentA truth valuation maps each variable to a proposition.
  • ThreeSATToClique.Clause3A 3-clause over $V$ is a structure with exactly three literals $l_1, l_2, l_3 : \mathtt{Literal}\,V$, representing a disjunction of…
Used by 3

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
/-- A 3-clause is satisfied if at least one of its three literals is true. -/
def ThreeSATToClique.clause3Satisfied {V : Type} (α : Assignment V) (c : Clause3 V) : Prop :=
  evalLiteral α c.l1 ∨ evalLiteral α c.l2 ∨ evalLiteral α c.l3
See it in the graphDiscuss this resultChallenge it