  We prove a limitation on a variant of the KPT theorem proposed for
propositional proof systems by Pich and Santhanam (2020), for all proof systems
that prove the disjointness of two NP sets that are hard to distinguish.
