AFTD Auto-Formalizing Theoretical Domains

spider_blocked_two_three_level_five_sub_long_leg_j34_outward

theoremverified

With free centre, the state whose legs are a length-2 leg with far end outward, the (5,inward) leg, and the free leg 2 has Grundy value 1 at fuel 10.

Statement

theorem spider_blocked_two_three_level_five_sub_long_leg_j34_outward :
    spider_gamma 10 CentreStatus.none [(2, SpiderLegEnd.outward), (5, SpiderLegEnd.inward), (2, SpiderLegEnd.free)] = 1
Source
step towards spider_blocked_two_three_level_five_sub_long_leg_j34
Verified
20 Oct 2026
Axioms
Quot.soundpropext
Built on 3
  • CentreStatusThe status of the central vertex in a spider state: none (no marked arcs incident), incoming (at least one incoming arc), outgoing (at…
  • 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…
  • spider_gammaThe function spider_gamma computes a natural number from a fuel parameter fuel : ℕ, a centre status s : CentreStatus, and a list of spider…
Used by 1

The proof, explained

The theorem asserts that a specific three-legged spider configuration—having centre status `none` and legs `(2, outward)`, `(5, inward)`, and `(2, free)`—has Grundy value 1 with fuel 10. Because the game rules and the nim-value function `spider_gamma` are completely computable on concrete data, the proof proceeds entirely by direct evaluation using the `decide` tactic.

  1. The Grundy value of the spider game state with centre status `none` and legs `(2, outward)`, `(5, inward)`, and `(2, free)` at fuel 10 is 1. automation

    The function `spider_gamma` is fully computable, and all its arguments are concrete finite values. The `decide` tactic evaluates the recursive game transitions, computes the Grundy values of all subpositions, and verifies by direct computation that the resulting value is 1.

    line 4

      decide

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 1 at fuel 10 for the state (none; {(2,outward), (5,inward), 2^*}). -/theorem spider_blocked_two_three_level_five_sub_long_leg_j34_outward :    spider_gamma 10 CentreStatus.none [(2, SpiderLegEnd.outward), (5, SpiderLegEnd.inward), (2, SpiderLegEnd.free)] = 1 := by  decide
See it in the graphDiscuss this resultChallenge it