3 problems

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.

Analyzability requires lower bounds. For every propositional proof system $Q$, if $Q$ is analyzable, then $Q$ is not optimal.

A p-optimal proof system is a propositional proof system that polynomially simulates every propositional proof system. No p-optimal proof system conjecture. There exists no p-optim…