/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/modulepublicimportFormalConjecturesUtil
Complete disjoint NP pairs
References:
[Ra94] Razborov, A. A. (1994). "On provably disjoint NP-pairs." BRICS Report Series
RS-94-36; ECCC TR94-006.
[KMT03] Köbler, J., Messner, J., and Torán, J. (2003). "Optimal proof systems imply complete
sets for promise classes." Inform. and Comput. 184, pp. 71--92.
[GSSZ04] Glaßer, C., Selman, A. L., Sengupta, S., and Zhang, L. (2004). "Disjoint NP-pairs."
SIAM J. Comput. 33, pp. 1369--1416.
[Pu17] Pudlák, P. (2017). "Incompleteness in the finite domain." Bull. Symbolic Logic 23,
pp. 405--441. arXiv:1601.01487
[Kh22] Khaniki, E. (2022). "New relations and separations of conjectures about incompleteness
in the finite domain." J. Symbolic Logic 87, pp. 912--937.
arXiv:1904.01362
The pair (A, B)reduces to the pair (A', B'): a polynomial-time map sends A into
A' and B into B' (a many-one reduction of pairs, [GSSZ04, Theorem 2.14]).
There is no complete disjoint NP pair (Razborov [Ra94]; Pudlák's conjecture DisjNP [Pu17]).
No disjoint NP pair is complete under polynomial-time many-one reductions of pairs. This is the
strongest of the "incompleteness in the finite domain" conjectures: it implies that no
length-optimal propositional proof system exists [Ra94, KMT03], hence NP ≠ coNP and P ≠ NP.
Equivalently [Pu17], for every consistent polynomial-time axiomatized theory T ⊇ S¹₂ some
disjoint NP pair is not provably disjoint in T.
There is no complete disjoint coNP pair (Pudlák's conjecture DisjCoNP [Pu17]).
No disjoint coNP pair is complete under polynomial-time many-one reductions of pairs. This
implies that TFNP has no complete problem and that SAT has no p-optimal proof system
[Pu17, Kh22].
If NP = coNP then a complete disjoint NP pair exists [GSSZ04, Pu17].
The pair (SAT, ¬SAT) is then a disjoint NP pair, and every disjoint NP pair (A, B) reduces
to it via a Cook–Levin reduction of A to SAT, since B is disjoint from A.