AFTD Auto-Formalizing Theoretical Domains

in715_deficit_z_ok

theoremverified

Finite certificate for the explicit fourteen-vertex graph.

Statement

theorem in715_deficit_z_ok : Z.card = 5 ∧ ∀ t ∈ Z, G.IsNClique 3 t ∧ (9 : Fin 14) ∈ t
Source
Finite graph and certificates from experiments 20940 and 20968; see state/campaigns/triangle_reductions/outside_induced_kernel_in701.md.
Verified
10 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
Used by 1
  • in715_deficit_preciseAn explicit fourteen-vertex graph has a maximum seven-triangle packing, a seven-edge triangle cover, an outside five-cycle link and a…

The proof, explained

The theorem verifies that an explicit collection Z of 3-element subsets of a 14-vertex graph G has cardinality 5, and that each such set is a clique in G containing the vertex 9. Because all definitions involve finite, decidable structures, the goal is established entirely by direct kernel computation.

  1. |Z| = 5, and every element t ∈ Z is a 3-clique of G containing vertex 9. automation

    The statement is a conjunction of decidable conditions over an explicit finite graph on 14 vertices and an explicitly listed collection Z of five 3-element subsets. The tactic `decide +kernel` evaluates the finite boolean predicates in Lean's kernel, exhaustively verifying that Z has five distinct elements and that each element forms a triangle in G containing 9.

    line 6

    theorem in715_deficit_z_ok : Z.card = 5 ∧ ∀ t ∈ Z, G.IsNClique 3 t ∧ (9 : Fin 14) ∈ t := by decide +kernel

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

open scoped Sym2set_option maxRecDepth 100000set_option maxHeartbeats 30000000open In701Deficit14theorem in715_deficit_z_ok : Z.card = 5 ∧ ∀ t ∈ Z, G.IsNClique 3 t ∧ (9 : Fin 14) ∈ t := by decide +kernel
See it in the graphDiscuss this resultChallenge it