AFTD Auto-Formalizing Theoretical Domains

ThreeSATToClique.literalsConflict

defimported Lean

Two literals $l_1$ and $l_2$ conflict if one is the positive and the other the negative occurrence of the same variable, i.e.\ $l_1 = \texttt{pos}\,v$ and $l_2 = \texttt{neg}\,v$ (or vice versa) for some $v$.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
def ThreeSATToClique.literalsConflict {V : Type} (l1 l2 : Literal V) : Prop
Defined in
TCSlib, `ThreeSATToClique.literalsConflict`
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 1
  • ThreeSATToClique.LiteralA literal for switching-lemma formulas: a variable $\mathtt{var} : \mathrm{Fin}\,n$ with a negation flag $\mathtt{neg} : \mathrm{Bool}$…
Used by 6

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
/-- Two literals *conflict* if one is the positive and the other the negative occurrence of the same variable. -/
def ThreeSATToClique.literalsConflict {V : Type} (l1 l2 : Literal V) : Prop :=
  match l1, l2 with
  | .pos v1, .neg v2 => v1 = v2
  | .neg v1, .pos v2 => v1 = v2
  | _, _ => False
See it in the graphDiscuss this resultChallenge it