Context
Anonymous overlap types can all agree while the cards still fail to share one coherent naming. The smallest computed witness converts that mismatch into an equivariant matching defect.
Proof or evidence
All 18 synchronizations and all 864 actions of pass; the zero defect has size six and the three nonzero values have size four each.
Verification notes
An independent implementation reconstructed all 18 type-slot synchronizations, all 73,728 candidate row namings, the two symmetry orbits, all 864 S2 x S4 equivariance actions, and the 52-graph marked-orbit control through order five.
Limitations
- The defect is proved for this chamber, not yet a universal graph-deck cohomology theory.