AFTD Auto-Formalizing Theoretical Domains

spider_blocked_two_three_level_five_sub_sum_six

theoremverified

The two sub-states with free centre, a short leg of length 1 whose far end is inward (resp. outward), and the free legs 2 and 3, have value 2 at fuel 10.

Statement

theorem spider_blocked_two_three_level_five_sub_sum_six :
    spider_gamma 10 CentreStatus.none [(1, SpiderLegEnd.inward), (2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] = 2 ∧
    spider_gamma 10 CentreStatus.none [(1, SpiderLegEnd.outward), (2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] = 2
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 that two three-legged spider states—differing only in whether the leg of length 1 is oriented inward or outward—both have Grundy value 2 at fuel 10. The proof splits the conjunction into the two cases, uses `spider_gamma_fuel_independent` to lower the fuel parameter from 10 to the minimal sufficient fuel 7, and then computes the values directly to 2 via `decide`.

  1. Both configurations reduce by fuel independence to fuel 7, where exhaustive evaluation confirms their Grundy value is 2. automation

    The conjunction is split into two independent subgoals for the inward and outward orientations of the length-1 leg. In each case, the sum of the leg lengths is 1 + 2 + 3 = 6, so the minimal sufficient fuel is 6 + 1 = 7. Applying `spider_gamma_fuel_independent` with fuel 10 (valid since 7 ≤ 10, checked by `decide`) rewrites the expression to use fuel 7. Finally, Lean evaluates `spider_gamma` on the finite game state by computational reflection (`decide`), calculating the Sprague-Grundy value to be 2 in both cases.

    line 5

    uses spider_gamma_fuel_independent

      refine ⟨?_, ?_⟩ <;> rw [spider_gamma_fuel_independent 10 _ _ (by decide)] <;> decide
spider_gamma_fuel_independent
If the fuel is at least the sum of the leg lengths plus 1, the value of `spider_gamma` is independent of the fuel and equals its value at that minimal fuel 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 2 of the two j = 2 cuts of the long leg, at fuel 10. -/theorem spider_blocked_two_three_level_five_sub_sum_six :    spider_gamma 10 CentreStatus.none [(1, SpiderLegEnd.inward), (2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] = 2 ∧    spider_gamma 10 CentreStatus.none [(1, SpiderLegEnd.outward), (2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] = 2 := by  refine ⟨?_, ?_⟩ <;> rw [spider_gamma_fuel_independent 10 _ _ (by decide)] <;> decide
See it in the graphDiscuss this resultChallenge it