It is shown that graph-theoretic problem CLIQUE can't be solved in polynomial time by any deterministic TM. This upgrades the well-known partial result that claims only monotone unsolvability thereof, and eventually implies P $\neq$ NP as CLIQUE is NP-complete. This paper essentially simplifies my previous presentation that used more complex models of computation based on standard Boolean semantics while fixing technical errors spotted by a generic proof assistant Isabelle that has been implemented by René Thiemann.

翻译：本文证明了图论问题 CLIQUE 无法被任何确定型图灵机在多项式时间内求解。这一结果改进了已知的仅能证明该问题单调不可解的局部结论，并最终推导出 P ≠ NP，因为 CLIQUE 是 NP 完全的。本文本质上简化了笔者先前基于标准布尔语义的复杂计算模型表述，同时修正了由 René Thiemann 实现的通用证明辅助工具 Isabelle 所发现的技术错误。