The critical Almost Stacked Hypothesis fails on a nine-vertex graph

John Fairfax-Ball

A connected nonbipartite nine-vertex graph has stacking and clearing thresholds of 15 pebbles. Its almost-stacked threshold is 14 for both tasks. The graph refutes the critical form of the Almost Stacked Hypothesis for stacking and clearing.

What was already known

The critical form compares the first size from which every configuration wins with the first size from which every almost-stacked configuration wins. It differs from the printed pointwise formulation.

AI involvement AI-led

Fairfax-Ball set the direction and approved sessions. The project records Claude and Codex carrying out the mathematical work, certificate construction, independent agent rechecks and Lean development.

Importance Notable

An explicit finite graph separates two thresholds that the critical hypothesis predicts are equal.

Technical verification Formal (Lean)

The pinned project reports Lean checking of the two refutations, exact certificate replay and Comparator verification with several kernels. One external checker was inconclusive under the memory limit.

Formal checking

The pinned project reports Lean checking of the two refutations, exact certificate replay and Comparator verification with several kernels. One external checker was inconclusive under the memory limit.

Checker
John Fairfax-Ball, reporting Lean 4 verification
Scope
The pinned project reports Lean checking of the two refutations, exact certificate replay and Comparator verification with several kernels. One external checker was inconclusive under the memory limit.
Basis
Reported by the linked checker

Human understanding Few

The project publishes an argument for the critical stacking loser, but does not attribute that explanation to a human.

Correction and publication history