A missing multiplicity condition for double-permutation sequences

The four term-sequence axioms printed in the inspected Goodman-Pollack manuscript and the official 2008 Oberwolfach problem session do not imply the proposed connected-set encoding with compatible tangent and separating pseudolines. The explicit two-body period A,B,A,B,C,B,C,B has least period eight, respects both endpoint orders, makes one adjacent different-body swap at each step, and satisfies reverse-toggle half-period symmetry. Every mixed primed/unprimed switch is absent, whereas the required internal tangents must produce mixed events. This is a negative answer to the literal universal realization assertion under those four axioms. The note also proves that an explicitly required fully separated input term forces every ordered different-body switch exactly once per full period. It does not construct polygons or refute the normalized-input variant. Older stronger allowable-interval definitions are credited to Dhandapani, Goodman, Holmsen and Pollack and to Novick. Habert and Pocchiola already proved the properly constrained specified-fibration representation theorem; the example is outside that input class. No new solution of that stronger theorem is claimed. The source-bound correction concerns the inspected 26 November 2006 author manuscript and official OWR44/2008 passages. The final Goodman-Pollack journal body and an older cited 2004 version were not obtained. Bounded primary-source and citation searches identified no matching earlier literal-negative result, but firstness, exhaustive priority and present-day worldwide open status are not certified. The companion source archive preserves all 32 frozen candidate files, distinct combinatorial and geometric mathematical audits, two independent priority reviews and exact finite checks. It reproduces the eight-term witness, two independent exhaustive two-body enumerations, separated-start controls, corrupted-input rejection and recursive artifact custody. Software does not formally certify the topological representation theorem, the general proof or literature completeness. AI tools were used extensively in development, source investigation, writing, reproduction, verification and adversarial review. This is an unrefereed preprint without external human peer review or proof-assistant certification. The note and authored companion material are CC BY 4.0; no third-party source PDF or full extracted body is redistributed.