spider_blocked_two_three_level_five_sub_long_leg_j4_inward
With free centre, the state whose legs are the (4,inward) leg together with the free legs 2 and 3 has Grundy value 5 at fuel 10.
Statement
theorem spider_blocked_two_three_level_five_sub_long_leg_j4_inward :
spider_gamma 10 CentreStatus.none [(4, SpiderLegEnd.inward), (2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] = 5- Source
- step towards spider_blocked_two_three_level_five_sub_long_leg_j4
- Verified
- 20 Oct 2026
- Axioms
Quot.soundpropext- Built on 3
- spider_gammaThe function spider_gamma computes a natural number from a fuel parameter fuel : ℕ, a centre status s : CentreStatus, and a list of spider…
- 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
- spider_blocked_two_three_level_five_sub_long_leg_j4Cutting the (5,inward) leg at j = 5 leaves, besides the free legs 2 and 3, a leg of length 4; at fuel 10 the value is 5 both when that…
The proof, explained
The theorem evaluates the Grundy value (nim-value) of a specific spider graph configuration with uncommitted centre and three legs: an inward leg of length 4 and two free legs of lengths 2 and 3. With a fuel bound of 10, the definition of `spider_gamma` is a completely explicit finite recursive computation over the game tree. The claim is proved by direct computational evaluation via the `decide` tactic.
spider_gamma 10 CentreStatus.none [(4, SpiderLegEnd.inward), (2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] = 5 automation
The function `spider_gamma` computes the Grundy value (nim-value) of the spider graph state recursively by enumerating all legal moves and taking the minimum excluded value (`nat_mex_list`) of the reachable options. Because all arguments—fuel 10, centre status `none`, and the list of three legs—are concrete constants, the entire game tree is finite and computable. The `decide` tactic evaluates the recursive definition directly to establish the equality.
decide
- The `decide` tactic closes the goal entirely by computational reduction, calculating the finite game tree through the recursive definitions of `spider_gamma` and `nat_mex_list`.
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
/-- The single expensive conjunct of the j = 5 cut of the level-5 long leg: value 5 for the inward continuation. -/theorem spider_blocked_two_three_level_five_sub_long_leg_j4_inward : spider_gamma 10 CentreStatus.none [(4, SpiderLegEnd.inward), (2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] = 5 := by decide