AFTD Auto-Formalizing Theoretical Domains

NAEtoColor.NAEclause

structureimported Lean

A Not-All-Equal Clause

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
structure NAEtoColor.NAEclause (V : Type)
Defined in
TCSlib, `NAEtoColor.NAEclause`
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
Used by 7
  • NAEtoColor.NAEtoColorCompletenessCompleteness of the NAE-SAT to 3-coloring reduction. Let $f$ be a NAE-SAT instance over a variable type $V$, that is, a list of…
  • NAEtoColor.NAEtoColorSoundnessSoundness of the NAE-SAT to 3-coloring reduction. Let $f$ be a NAE-SAT instance over a variable type $V$, that is, a list of Not-All-Equal…
  • NAEtoColor.OutputVertexThe vertex set of the reduction graph is an inductive type with three constructors:
    • $\mathtt{groundNode}$ --- a…
  • NAEtoColor.SatisfiesClauseGiven a Boolean assignment $\mathit{assign} : V \to \mathtt{Bool}$ and a Not-All-Equal clause $c$ with three variables…
  • NAEtoColor.naeColoringGiven a Boolean assignment $\mathit{assign} : V \to \mathtt{Bool}$, defines a coloring of all vertices of the reduction graph by:…
  • NAEtoColor.NAESat3A NAE-SAT instance over variable type $V$ is defined as a list of NAE clauses, i.e.\…
  • NAEtoColor.EdgeRelationGiven a NAE-SAT instance $\mathit{clauses}$, the directed edge relation on $\texttt{NAEtoColor.OutputVertex}\;V$ is defined by: (1)…

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
/-- A Not-All-Equal Clause -/
structure NAEtoColor.NAEclause (V : Type) where
  v0 : V
  v1 : V
  v2 : V
See it in the graphDiscuss this resultChallenge it