AFTD Auto-Formalizing Theoretical Domains

SATtoColor.SatisfiesSat3

defimported Lean

An assignment $\mathrm{assign}$ satisfies a 3-SAT instance $f$ if every clause in the list $f$ is satisfied by $\mathrm{assign}$, i.e.\ $\mathrm{SatisfiesSat3}(\mathrm{assign}, f) = \texttt{true}$ iff $\forall c \in f,\; \mathrm{SatisfiesClause}(\mathrm{assign}, c) = \texttt{true}$.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
def SATtoColor.SatisfiesSat3 {V : Type} (assign : V → Bool) (f : Sat3 V) : Bool
Defined in
TCSlib, `SATtoColor.SatisfiesSat3`
Lean proof
By CS 294-268 course staff (UC Berkeley, Spring 2026), from github.com/Shilun-Allan-Li/tcslib at c8a02591b1e5 (Copyright (c) 2026 UC Berkeley CS 294. 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
  • SATtoColor.SatisfiesClauseUnder assignment $\mathrm{assign}$, a clause $c$ is satisfied if at least one of its three literals evaluates to true:…
  • SATtoColor.Sat3A 3-SAT instance over variable type $V$ is defined as a list of clauses, i.e.\ $\mathrm{Sat3}(V) := \mathrm{List}(\mathrm{Clause}\,V)$.
  • SATtoColor.ClauseA clause over a variable type $V$ is a structure bundling exactly three literals $\ell_1, \ell_2, \ell_3 : \mathrm{Literal}\,V$.…
Used by 3
  • SATtoColor.SATtoColorSoundnessSoundness of the 3-SAT to 3-colouring reduction. Let $f$ be a 3-SAT instance over a variable type $V$, that is, a list of clauses, each…
  • SATtoColor.IsSatisfiableA 3-SAT instance $f$ is satisfiable if there exists a Boolean assignment that satisfies it:…
  • SATtoColor.SATtoColorCompletenessCompleteness of the 3-SAT to 3-coloring reduction. Let $f$ be a 3-SAT instance over a variable type $V$, that is, a list of clauses, each…

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
def SATtoColor.SatisfiesSat3 {V : Type} (assign : V → Bool) (f : Sat3 V) : Bool :=
  f.all (SatisfiesClause assign)
See it in the graphDiscuss this resultChallenge it