AFTD Auto-Formalizing Theoretical Domains

spider_blocked_two_three_level_five_sub_sum_nine

theoremverified

Four sub-states at fuel 10: the states (incoming;{(5,inward),(3,free)}) and (outgoing;{(5,inward),(3,free)}) have value 4 and 6, and the states with free centre obtained by cutting the free leg of length 3 at j = 1, which add a leg of length 2 with far end inward (resp. outward) to (5,inward), have value 2 and 3.

Statement

theorem spider_blocked_two_three_level_five_sub_sum_nine :
    spider_gamma 10 CentreStatus.incoming [(5, SpiderLegEnd.inward), (3, SpiderLegEnd.free)] = 4 ∧
    spider_gamma 10 CentreStatus.outgoing [(5, SpiderLegEnd.inward), (3, SpiderLegEnd.free)] = 6 ∧
    spider_gamma 10 CentreStatus.none [(1, SpiderLegEnd.inward), (5, SpiderLegEnd.inward), (3, SpiderLegEnd.free)] = 2 ∧
    spider_gamma 10 CentreStatus.none [(1, SpiderLegEnd.outward), (5, SpiderLegEnd.inward), (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 theorem establishes the Grundy values computed by `spider_gamma` for four sub-states of a spider graph game at fuel level 10. The proof splits the four-way conjunction into individual goals, simplifies the recursion fuel of each state to the sum of leg lengths plus one via `spider_gamma_fuel_independent`, and finishes each case by direct computational evaluation with `decide`.

  1. Each of the four game configurations evaluates to its specified Grundy value (4, 6, 2, and 3, respectively). automation

    The four-part conjunction is split into four separate goals (`refine ⟨?_, ?_, ?_, ?_⟩`). In each goal, `spider_gamma_fuel_independent` rewrites the fuel parameter (10) down to the sum of the leg lengths plus one, discharging the side condition that this sum plus one is at most 10 by arithmetic decision (`decide`). Finally, `decide` evaluates the recursive game definition (`spider_gamma`) by direct finite computation to verify each equality.

    line 7

    uses spider_gamma_fuel_independent

      refine ⟨?_, ?_, ?_, ?_⟩ <;> rw [spider_gamma_fuel_independent 10 _ _ (by decide)] <;> decide
spider_gamma_fuel_independent
For any game configuration with leg list L and center status s, if the fuel parameter is at least the sum of the leg lengths plus 1, then `spider_gamma fuel s L` equals `spider_gamma ((sum of lengths) + 1) s L`.

Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- Values 4, 6, 2, 3 of the sub-states reached from the free leg 3, at fuel 10. -/theorem spider_blocked_two_three_level_five_sub_sum_nine :    spider_gamma 10 CentreStatus.incoming [(5, SpiderLegEnd.inward), (3, SpiderLegEnd.free)] = 4 ∧    spider_gamma 10 CentreStatus.outgoing [(5, SpiderLegEnd.inward), (3, SpiderLegEnd.free)] = 6 ∧    spider_gamma 10 CentreStatus.none [(1, SpiderLegEnd.inward), (5, SpiderLegEnd.inward), (3, SpiderLegEnd.free)] = 2 ∧    spider_gamma 10 CentreStatus.none [(1, SpiderLegEnd.outward), (5, SpiderLegEnd.inward), (3, SpiderLegEnd.free)] = 3 := by  refine ⟨?_, ?_, ?_, ?_⟩ <;> rw [spider_gamma_fuel_independent 10 _ _ (by decide)] <;> decide
See it in the graphDiscuss this resultChallenge it