AFTD Auto-Formalizing Theoretical Domains

in715_deficit_missing

theoremverified

Finite certificate for the explicit fourteen-vertex graph.

Statement

theorem in715_deficit_missing : ¬ G.Adj 9 3
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 establishes that vertices 9 and 3 are not adjacent in the explicit 14-vertex graph G. Since the graph and its edge set are fully defined by finite enumeration, this non-adjacency property is decidable. The result is verified by direct computational evaluation in Lean's kernel.

  1. Vertices 9 and 3 are not adjacent in the graph G. automation

    Because G is an explicit graph on 14 vertices whose edge set is given as a concrete finite set of unordered pairs, adjacency is a decidable predicate. The tactic evaluates whether the edge {9, 3} belongs to this edge set by direct kernel reduction, confirming that it does not.

    line 6

    theorem in715_deficit_missing : ¬ G.Adj 9 3 := 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_missing : ¬ G.Adj 9 3 := by decide +kernel
See it in the graphDiscuss this resultChallenge it