III.T33 — τ-Admissibility Collapse

τ-P_adm = τ-NP_adm. For every τ-admissible NP problem, CRT-structured witness search runs in polynomial time. Three-step proof: (i) constant-width Cook-Levin tableau, (ii) polynomial CRT refinement, (iii) Product-Meet Collapse.