AFTD Auto-Formalizing Theoretical Domains

spider_blocked_two_three_level_five_sub_incoming_two_three

theoremverified

With centre incoming (resp. outgoing) and free legs of length 2 and 3, the value at fuel 10 is 3 (both).

Statement

theorem spider_blocked_two_three_level_five_sub_incoming_two_three :
    spider_gamma 10 CentreStatus.incoming [(2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] = 3 ∧
    spider_gamma 10 CentreStatus.outgoing [(2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] = 3
Source
step towards spider_blocked_two_three_level_five
Verified
20 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 4
  • spider_gammaThe function spider_gamma computes a natural number from a fuel parameter fuel : ℕ, a centre status s : CentreStatus, and a list of spider…
  • spider_gamma_fuel_independentFor every fuel at least the total number of markable edges in L plus one, the value of spider_gamma does not depend on the fuel: it equals…
  • SpiderLegEndThe end condition of an attached leg in a spider state is either free (no arc on the leg), inward (pointing towards the centre), or…
  • CentreStatusThe status of the central vertex in a spider state: none (no marked arcs incident), incoming (at least one incoming arc), outgoing (at…
Used by 1

The proof, explained

The proof splits the conjunction into the two centre cases (incoming and outgoing). In each case, it uses `spider_gamma_fuel_independent` to reduce the fuel parameter from 10 to $(2 + 3) + 1 = 6$, since 6 ≤ 10. The remaining equalities are then verified by direct computation (`decide`), evaluating the recursive definition of `spider_gamma`.

  1. Both the centre-incoming and centre-outgoing spider configurations with free legs of lengths 2 and 3 have game value 3 at fuel 10. automation

    The proof splits the conjunction into two separate goals: one for the incoming centre status and one for the outgoing centre status (`refine ⟨?_, ?_⟩`). For each goal, it applies `spider_gamma_fuel_independent` to rewrite the fuel parameter from 10 down to the stabilization threshold $(2 + 3) + 1 = 6$; the inequality $6 \le 10$ is verified by `decide`. Finally, Lean evaluates the recursive definition of `spider_gamma` on the finite game state at fuel 6 by decision procedure (`decide`), verifying that both configurations yield value 3.

    line 5

    uses spider_gamma_fuel_independent

      refine ⟨?_, ?_⟩ <;> rw [spider_gamma_fuel_independent 10 _ _ (by decide)] <;> decide
spider_gamma_fuel_independent
The game value `spider_gamma fuel s L` is independent of the fuel once `fuel` is at least the sum of the leg lengths in `L` plus one, so the fuel parameter can be replaced by that threshold.

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

/-- Value 3 of the centre-incoming and centre-outgoing two-legged sub-states at fuel 10. -/theorem spider_blocked_two_three_level_five_sub_incoming_two_three :    spider_gamma 10 CentreStatus.incoming [(2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] = 3 ∧    spider_gamma 10 CentreStatus.outgoing [(2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] = 3 := by  refine ⟨?_, ?_⟩ <;> rw [spider_gamma_fuel_independent 10 _ _ (by decide)] <;> decide
See it in the graphDiscuss this resultChallenge it