The p-optimality obstruction conjecture for analyzable proof systems

Let $Q$ be a propositional proof system. A proof system is analyzable when its associated proof-analysis problem admits the efficient analysis described in the paper, and it is p-optimal when it simulates every propositional proof system with polynomial overhead.

Analyzability requires lower bounds or proofs that are hard to find. For every propositional proof system $Q$, if $Q$ is analyzable, then $Q$ is not p-optimal.

This is a weaker proposed conclusion than non-optimality: failure of p-optimality permits explicit tautology families whose proofs are either long or short but computationally hard to find. The conjecture remains open in the source.