No complete disjoint NP-pair conjecture

A disjoint NP pair is a pair $(A,B)$ of disjoint languages in NP, and polynomial reduction between pairs maps the first component to the first and the second to the second. No complete disjoint NP-pair conjecture. There exist no complete disjoint NP pair with respect to polynomial reductions. The source presents this as a strengthening of the nonuniform finite consistency conjecture; oracle results give evidence in both directions.