  We build on a working program initiated by Pudl\'ak [Pud17] and construct an
oracle relative to which each $\mathrm{coNP}$-complete set has
$\mathrm{P}$-optimal proof systems and $\mathrm{NP}\cap\mathrm{coNP}$ does not
have complete problems.
