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.ThreeSATToClique.literalsConflict← ThreeSATToClique.literalsConflict (TCSlib/Complexity/NPReductions/ThreeSATToClique.lean:139): verbatim
- 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
- ThreeSATToClique.no_conflict_of_trueTrue literals never conflict. Let $\alpha$ be a truth assignment on a set $V$ of variables, and let $\ell_1,\ell_2$ be literals over $V$,…
- ThreeSATToClique.clique_vertices_choose_one_per_clauseOne clique vertex per clause. Let $f$ be a 3-CNF formula with $m$ clauses, and let $s$ be a set of vertices of the conflict graph of $f$.…
- ThreeSATToClique.ThreeSAT_to_Clique_soundnessSoundness of the 3-SAT to clique reduction. Let $f$ be a 3-CNF formula consisting of $m$ clauses. If the conflict graph of $f$ has an…
- ThreeSATToClique.ThreeSAT_to_Clique_completenessCompleteness of the 3-SAT to clique reduction. Let $f$ be a 3-CNF formula consisting of $m$ clauses, and let its conflict graph be the…
- ThreeSATToClique.toCliqueGraphThe conflict graph of a 3-CNF formula $f$ is the simple graph on vertex set $\mathtt{CliqueVertex}\,f.\mathtt{length}$ in which two…
- ThreeSATToClique.literalsConflict_symmSymmetry of literal conflict. Call two literals over a variable set *conflicting* when one is the positive and the other the negative…
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