AFTD Auto-Formalizing Theoretical Domains

poc8_cover_check

theoremverified

The cover condition holds for all terminal tuples (x, y, a, b, c).

Statement

theorem poc8_cover_check (x y a b c : Fin 8) : poc8_cover_ok x y a b c = true
Source
step towards poc_linkedness_conjecture_counterexample (counterexample to arXiv:1908.05433, Conjecture 3.10; kernel-checked certificate)
Verified
06 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 9
  • poc8_cover_check_0Kernel check of the cover condition for all terminal tuples with first terminal x = 0.
  • poc8_cover_check_1Kernel check of the cover condition for all terminal tuples with first terminal x = 1.
  • poc8_cover_check_2Kernel check of the cover condition for all terminal tuples with first terminal x = 2.
  • poc8_cover_check_3Kernel check of the cover condition for all terminal tuples with first terminal x = 3.
  • poc8_cover_check_4Kernel check of the cover condition for all terminal tuples with first terminal x = 4.
  • poc8_cover_check_5Kernel check of the cover condition for all terminal tuples with first terminal x = 5.
  • poc8_cover_check_6Kernel check of the cover condition for all terminal tuples with first terminal x = 6.
  • poc8_cover_check_7Kernel check of the cover condition for all terminal tuples with first terminal x = 7.
  • poc8_cover_okCheck for terminals x, y, a, b, c: either they are not distinct, or some stored mask contains x and y and avoids a, b, c.
Used by 1
  • poc8_linked_two_threeThe 8-vertex graph G is (2,3)-linked: any 2 terminals and 3 further terminals are separated by a connected bipartition of G.

Lean source view module on GitHub

theorem poc8_cover_check (x y a b c : Fin 8) : poc8_cover_ok x y a b c = true := by  fin_cases x  exacts [poc8_cover_check_0 y a b c, poc8_cover_check_1 y a b c, poc8_cover_check_2 y a b c,    poc8_cover_check_3 y a b c, poc8_cover_check_4 y a b c, poc8_cover_check_5 y a b c,    poc8_cover_check_6 y a b c, poc8_cover_check_7 y a b c]
See it in the graphDiscuss this resultChallenge it