AFTD Auto-Formalizing Theoretical Domains

ThreeSATToClique.CliqueVertex

structureimported Lean

A vertex of the conflict graph for a formula with $m$ clauses is a pair $\langle c\_idx, l\_idx \rangle$ where $c\_idx : \mathrm{Fin}\,m$ is a clause index and $l\_idx : \mathrm{Fin}\,3$ is a literal position within that clause.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
structure ThreeSATToClique.CliqueVertex (m : Nat)
Defined in
TCSlib, `ThreeSATToClique.CliqueVertex`
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
Used by 7

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
/-- A vertex of the conflict graph names a literal by its clause index `c_idx : Fin m` and its position `l_idx : Fin 3` within that clause. -/
structure ThreeSATToClique.CliqueVertex (m : Nat) where
  c_idx : Fin m
  l_idx : Fin 3
deriving DecidableEq
See it in the graphDiscuss this resultChallenge it