AFTD Auto-Formalizing Theoretical Domains

spider_blocked_two_three_level_five_sub_sum_eight

theoremverified

Four sub-states at fuel 10: the two states obtained by cutting the long leg at j = 4, which add a leg of length 3 with far end inward (resp. outward) to the free legs 2 and 3, have value 7; and the two states obtained by cutting the free leg of length 3 at j = 2, which add a leg of length 1 with far end inward (resp. outward) to (5,inward) and (2,free), have value 1 (inward) and 0 (outward).

Statement

theorem spider_blocked_two_three_level_five_sub_sum_eight :
    spider_gamma 10 CentreStatus.none [(3, SpiderLegEnd.inward), (2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] = 7 ∧
    spider_gamma 10 CentreStatus.none [(3, SpiderLegEnd.outward), (2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] = 7 ∧
    spider_gamma 10 CentreStatus.none [(1, SpiderLegEnd.inward), (5, SpiderLegEnd.inward), (2, SpiderLegEnd.free)] = 1 ∧
    spider_gamma 10 CentreStatus.none [(1, SpiderLegEnd.outward), (5, SpiderLegEnd.inward), (2, SpiderLegEnd.free)] = 0
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 determines the Grundy values (7, 7, 1, and 0) for four spider positions at fuel 10 with an unoccupied center. The proof splits the conjunction into the four subgoals. For each subgoal, it uses `spider_gamma_fuel_independent` to lower the fuel parameter from 10 to 9, which is the sum of the leg lengths plus one, and then evaluates the recursive definition of `spider_gamma` directly by computation (`decide`).

  1. Each of the four spider game states at fuel 10 evaluates to its stated Grundy value: 7, 7, 1, and 0 respectively. automation

    The four-part conjunction is split into four individual evaluation goals. In each case, the sum of the leg lengths is 8 (either 3 + 2 + 3 or 1 + 5 + 2), so the required fuel bound is 8 + 1 = 9 ≤ 10. Rewriting with `spider_gamma_fuel_independent` replaces the fuel parameter 10 with 9, discharging the inequality 9 ≤ 10 by arithmetic decision (`decide`). Finally, with the reduced fuel, the recursive definition of `spider_gamma` is evaluated on each configuration by computation (`decide`) to confirm the values 7, 7, 1, and 0.

    line 7

    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 Grundy value `spider_gamma` evaluated at that fuel equals the value evaluated at exactly the sum of the leg lengths plus 1.

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

/-- Values 7, 7, 1, 0 of the j = 4 long-leg cuts and the j = 2 cuts of the free leg 3, at fuel 10. -/theorem spider_blocked_two_three_level_five_sub_sum_eight :    spider_gamma 10 CentreStatus.none [(3, SpiderLegEnd.inward), (2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] = 7 ∧    spider_gamma 10 CentreStatus.none [(3, SpiderLegEnd.outward), (2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] = 7 ∧    spider_gamma 10 CentreStatus.none [(1, SpiderLegEnd.inward), (5, SpiderLegEnd.inward), (2, SpiderLegEnd.free)] = 1 ∧    spider_gamma 10 CentreStatus.none [(1, SpiderLegEnd.outward), (5, SpiderLegEnd.inward), (2, SpiderLegEnd.free)] = 0 := by  refine ⟨?_, ?_, ?_, ?_⟩ <;> rw [spider_gamma_fuel_independent 10 _ _ (by decide)] <;> decide
See it in the graphDiscuss this resultChallenge it