claim narrative

authored prose — context, never evidence. the projection it belongs to is u.agora.claim.2026-10-28.computed.theorem15.chunk-t06-of-22-all-equal-verdict.

Theorem-15, chunk t06/22: trees 2501-3000 (500 of 10,879) of the <=7-internal-node
enumeration. One v1 run computes bf size X and size X for every tree in the chunk,
compares the two with an in-calculus equality (program c2d0c554), and folds AND.
result=10 means every tree here satisfies bf size X == size X. fuel=400000.
The 22 chunks partition all trees with <=7 internal nodes exactly once.