We introduce and empirically investigate \emph{contested cluster selectors} (\CCS): variables that are non-backbone, carry information about solution-cluster identity, and are repeatedly but unreliably forced by local propagation during backtracking search. In instrumented \DPLL{} experiments on random 3-\SAT{} near the empirical satisfiability threshold and on near-optimal random \VC{} instances, a small number of such variables accounts for a large fraction of observed backtracking cost. Pinning two or three high-contestedness variables to solution-consistent values reduces backtracking by 70--80\% on the reference instances studied, and a static degree--polarity metric yields a simple $2^k$ enumeration heuristic with a reported $3.7\times$ speedup over baseline \DPLL{} at $n=50$. A polynomial control experiment on random 3-\XORSAT{} sharpens the interpretation. Gaussian elimination exposes the true affine selector coordinates, whereas \DPLL{} churn concentrates on pivot variables chosen in a poor coordinate system. Thus clustering and non-backbone status are not enough: the empirical hardness signal is \emph{local contestation} that remains after available polynomial-time normal forms. We formalize this distinction through safe coordinate exposers and the \emph{unavoidable contested selector cost} (\UCSC). We also prove an ordered single-pass eraser-memory lower bound: any ordered \FERAM{} that recovers a $k$-bit cluster label from a distribution with residual min-entropy $k-η$ using $S$ bits succeeds with probability at most $2^{S+η-k}$. The paper positions \CCS/\UCSC{} as a structural program connecting backdoors, solution-space geometry, low-degree barriers, and Schaefer-style algebraic normal forms. We do not claim a proof of $P\ne NP$; rather, we isolate the normal-form barrier that any such extension would need to overcome.

翻译：本文引入并实证研究了竞争聚类选择器（\emph{contested cluster selectors}, \CCS）：此类变量非骨干变量，携带解聚类身份信息，在回溯搜索过程中被局部传播反复但不可靠地强制赋值。在经验可满足性阈值附近的随机 3-\SAT{} 及近优随机 \VC{} 实例的插装 \DPLL{} 实验中，少量此类变量即占据观测到的大部分回溯代价。将两到三个高竞争度变量固定为与解一致的值，可使所研究参考实例的回溯量减少 70–80%；一种静态度-极性度量方法提供了简单的 $2^k$ 枚举启发式策略，在 $n=50$ 时相比基线 \DPLL{} 报告了 $3.7\times$ 的加速比。在随机 3-\XORSAT{} 上开展的多项式控制实验进一步明确了该解释：高斯消元法揭示了真实仿射选择器坐标，而 \DPLL{} 的搜索振荡集中出现在选取自不良坐标系的主元变量上。因此，聚类与非骨干特性本身并不充分：经验难度信号源于可用多项式时间规范形式之后仍存在的局部竞争。我们通过安全坐标揭示器与不可避免竞争选择器代价（\unavoidable contested selector cost}, \UCSC）对该区分进行形式化。此外，我们证明了有序单遍擦除器存储下界：任何使用 $S$ 比特存储的有序 \FERAM{}，若要从残差最小熵为 $k-η$ 的分布中恢复 $k$ 比特聚类标签，其成功概率至多为 $2^{S+η-k}$。本文将 \CCS/\UCSC{} 定位为连接后门、解空间几何、低阶度障碍与 Schaefer 式代数规范形式的结构性研究纲领。我们不声称证明了 $P \neq NP$，而是分离出任何此类扩展需要克服的规范形式障碍。