AFTD Auto-Formalizing Theoretical Domains

spider_blocked_two_three_level_five

theoremverified

At level t = 5, the inward blocked family for the configuration (none; {2^*, 3^*}) at canonical fuel 11 is at most 7.

Statement

theorem spider_blocked_two_three_level_five :
    spider_gamma 11 CentreStatus.none [(5, SpiderLegEnd.inward), (2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] ≤ 7
Source
step towards spider_eventual_parity_two_three_blocked_small
Verified
20 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 14
Used by 1

The proof, explained

To show that the Grundy value of the inward-blocked spider configuration with legs (5, inward), (2, free), and (3, free) at fuel 11 is at most 7, the recursive definition is first expanded into the minimum excluded value of its 19 legal options at fuel 10. Each sub-configuration's Grundy value is then replaced by its precomputed value using auxiliary lemmas. Finally, Lean's `decide` tactic evaluates the list of bitwise XOR sums by computation, finding the minimum excluded value to be 4, which verifies that 4 ≤ 7.

  1. The Grundy value of the configuration is rewritten as the minimum excluded value of 19 concrete bitwise XOR sums.

    We expand the Grundy value `spider_gamma 11` using the recurrence `spider_blocked_two_three_level_five_options 10`, which expresses it as the minimum excluded value (`nat_mex_list`) of 19 reachable option values at fuel 10. We then substitute the precomputed values for each of the 19 sub-configurations using the corresponding sub-lemmas.

    lines 4–23

    uses spider_blocked_two_three_level_five_options, spider_blocked_two_three_level_five_sub_incoming_two_three.1, spider_blocked_two_three_level_five_sub_incoming_two_three.2, spider_blocked_two_three_level_five_sub_sum_six.1, spider_blocked_two_three_level_five_sub_sum_six.2, spider_blocked_two_three_level_five_sub_sum_seven.1, spider_blocked_two_three_level_five_sub_sum_seven.2, spider_blocked_two_three_level_five_sub_sum_eight.1, spider_blocked_two_three_level_five_sub_sum_eight.2.1, spider_blocked_two_three_level_five_sub_long_leg_j4.1, spider_blocked_two_three_level_five_sub_sum_nine.1, spider_blocked_two_three_level_five_sub_sum_nine.2.1, spider_blocked_two_three_level_five_sub_sum_nine.2.2.1, spider_blocked_two_three_level_five_sub_sum_nine.2.2.2, spider_blocked_two_three_level_five_sub_short_legs.1, spider_blocked_two_three_level_five_sub_short_legs.2, spider_blocked_two_three_level_five_sub_sum_eight.2.2.1, spider_blocked_two_three_level_five_sub_sum_eight.2.2.2, spider_blocked_two_three_level_five_sub_long_leg_j34.1, spider_blocked_two_three_level_five_sub_long_leg_j34.2

      rw [spider_blocked_two_three_level_five_options 10,
        spider_blocked_two_three_level_five_sub_incoming_two_three.1,
        spider_blocked_two_three_level_five_sub_incoming_two_three.2,
        spider_blocked_two_three_level_five_sub_sum_six.1,
        spider_blocked_two_three_level_five_sub_sum_six.2,
        spider_blocked_two_three_level_five_sub_sum_seven.1,
        spider_blocked_two_three_level_five_sub_sum_seven.2,
        spider_blocked_two_three_level_five_sub_sum_eight.1,
        spider_blocked_two_three_level_five_sub_sum_eight.2.1,
        spider_blocked_two_three_level_five_sub_long_leg_j4.1,
        spider_blocked_two_three_level_five_sub_sum_nine.1,
        spider_blocked_two_three_level_five_sub_sum_nine.2.1,
        spider_blocked_two_three_level_five_sub_sum_nine.2.2.1,
        spider_blocked_two_three_level_five_sub_sum_nine.2.2.2,
        spider_blocked_two_three_level_five_sub_short_legs.1,
        spider_blocked_two_three_level_five_sub_short_legs.2,
        spider_blocked_two_three_level_five_sub_sum_eight.2.2.1,
        spider_blocked_two_three_level_five_sub_sum_eight.2.2.2,
        spider_blocked_two_three_level_five_sub_long_leg_j34.1,
        spider_blocked_two_three_level_five_sub_long_leg_j34.2]
  2. The minimum excluded value is at most 7 (specifically, it is 4 ≤ 7).

    The goal is an inequality between computable expressions on natural numbers. The `decide` tactic evaluates the 19 bitwise XOR operations, yielding the multiset {0, 1, 2, 3, 5, 6, 7}, calculates the minimum excluded value as 4 (since 4 is the smallest natural number not in the list), and verifies that 4 ≤ 7.

    line 24

      decide
spider_blocked_two_three_level_five_options
Expresses the Grundy value of the spider configuration with legs (5, inward), (2, free), and (3, free) at fuel n + 1 as the minimum excluded value (mex) of the 19 game options at fuel n.
spider_blocked_two_three_level_five_sub_incoming_two_three.1
At fuel 10, the Grundy value for legs (2, free) and (3, free) with incoming center status is 3.
spider_blocked_two_three_level_five_sub_incoming_two_three.2
At fuel 10, the Grundy value for legs (2, free) and (3, free) with outgoing center status is 3.
spider_blocked_two_three_level_five_sub_sum_six.1
At fuel 10, the Grundy value for legs (1, inward), (2, free), and (3, free) with neutral center is 2.
spider_blocked_two_three_level_five_sub_sum_six.2
At fuel 10, the Grundy value for legs (1, outward), (2, free), and (3, free) with neutral center is 2.
spider_blocked_two_three_level_five_sub_sum_seven.1
At fuel 10, the Grundy value for legs (2, inward), (2, free), and (3, free) with neutral center is 6.
spider_blocked_two_three_level_five_sub_sum_seven.2
At fuel 10, the Grundy value for legs (2, outward), (2, free), and (3, free) with neutral center is 6.
spider_blocked_two_three_level_five_sub_sum_eight.1
At fuel 10, the Grundy value for legs (3, inward), (2, free), and (3, free) with neutral center is 7.
spider_blocked_two_three_level_five_sub_sum_eight.2.1
At fuel 10, the Grundy value for legs (3, outward), (2, free), and (3, free) with neutral center is 7.
spider_blocked_two_three_level_five_sub_long_leg_j4.1
At fuel 10, the Grundy value for legs (4, inward), (2, free), and (3, free) with neutral center is 5.
spider_blocked_two_three_level_five_sub_sum_nine.1
At fuel 10, the Grundy value for legs (5, inward) and (3, free) with incoming center status is 4.
spider_blocked_two_three_level_five_sub_sum_nine.2.1
At fuel 10, the Grundy value for legs (5, inward) and (3, free) with outgoing center status is 6.
spider_blocked_two_three_level_five_sub_sum_nine.2.2.1
At fuel 10, the Grundy value for legs (1, inward), (5, inward), and (3, free) with neutral center is 2.
spider_blocked_two_three_level_five_sub_sum_nine.2.2.2
At fuel 10, the Grundy value for legs (1, outward), (5, inward), and (3, free) with neutral center is 3.
spider_blocked_two_three_level_five_sub_short_legs.1
At fuel 10, the Grundy value for legs (5, inward) and (2, free) with incoming center status is 0.
spider_blocked_two_three_level_five_sub_short_legs.2
At fuel 10, the Grundy value for legs (5, inward) and (2, free) with outgoing center status is 1.
spider_blocked_two_three_level_five_sub_sum_eight.2.2.1
At fuel 10, the Grundy value for legs (1, inward), (5, inward), and (2, free) with neutral center is 1.
spider_blocked_two_three_level_five_sub_sum_eight.2.2.2
At fuel 10, the Grundy value for legs (1, outward), (5, inward), and (2, free) with neutral center is 0.
spider_blocked_two_three_level_five_sub_long_leg_j34.1
At fuel 10, the Grundy value for legs (2, inward), (5, inward), and (2, free) with neutral center is 0.
spider_blocked_two_three_level_five_sub_long_leg_j34.2
At fuel 10, the Grundy value for legs (2, outward), (5, inward), and (2, free) with neutral center is 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

/-- At level t = 5, the inward blocked family for the configuration (none; {2^*, 3^*}) at canonical fuel 11 is at most 7. -/theorem spider_blocked_two_three_level_five :    spider_gamma 11 CentreStatus.none [(5, SpiderLegEnd.inward), (2, SpiderLegEnd.free), (3, SpiderLegEnd.free)] ≤ 7 := by  rw [spider_blocked_two_three_level_five_options 10,    spider_blocked_two_three_level_five_sub_incoming_two_three.1,    spider_blocked_two_three_level_five_sub_incoming_two_three.2,    spider_blocked_two_three_level_five_sub_sum_six.1,    spider_blocked_two_three_level_five_sub_sum_six.2,    spider_blocked_two_three_level_five_sub_sum_seven.1,    spider_blocked_two_three_level_five_sub_sum_seven.2,    spider_blocked_two_three_level_five_sub_sum_eight.1,    spider_blocked_two_three_level_five_sub_sum_eight.2.1,    spider_blocked_two_three_level_five_sub_long_leg_j4.1,    spider_blocked_two_three_level_five_sub_sum_nine.1,    spider_blocked_two_three_level_five_sub_sum_nine.2.1,    spider_blocked_two_three_level_five_sub_sum_nine.2.2.1,    spider_blocked_two_three_level_five_sub_sum_nine.2.2.2,    spider_blocked_two_three_level_five_sub_short_legs.1,    spider_blocked_two_three_level_five_sub_short_legs.2,    spider_blocked_two_three_level_five_sub_sum_eight.2.2.1,    spider_blocked_two_three_level_five_sub_sum_eight.2.2.2,    spider_blocked_two_three_level_five_sub_long_leg_j34.1,    spider_blocked_two_three_level_five_sub_long_leg_j34.2]  decide
See it in the graphDiscuss this resultChallenge it