Propositional proof systems that apply various kinds of cuts to linear inequalities (such as Cutting Planes [CCT87] and Lift&Project [BCC93,Pud99,Das05]) or operate with disjunctions of linear inequalities (such as Res(CP) [Kra98] and Res(LP) [HK06]) have been in the focus of research for the past 30 years. Recently, tropical proof systems were introduced [AGH25]; they resemble the latter systems but differ from them in important respects. The relations between the traditional systems and the new tropical systems have remained largely unknown, and exponential lower bounds for tropical systems were limited to non-CNF examples. In this paper we prove several new polynomial simulations between these systems. To this end, we introduce Thr-Res (Threshold Resolution), a new natural daglike proof system operating on threshold conditions over the Boolean literals: lines asserting that at least s literals of a given multiset are true. Its main difference from CP is that the rounding rule (without it CP is incomplete) is replaced by a weaker rule that allows one to perform "resolution" steps with linear combinations beyond Boolean clauses; also, in its addition rules, Thr-Res resembles input resolution [Cha70]: a derived line is combined with an input clause or an axiom, whereas CP can add up any two derived lines. By varying the maximum value of s, one obtains systems ranging in strength from Resolution to MP-NSR, the static tropical (min-plus) proof system introduced in [AGH25]. As a consequence, we prove that MP-NSR is polynomially simulated by CP and L&P (even by their unary versions), which automatically yields exponential lower bounds on the size of MP-NSR proofs for formulas in CNF. We complement it with simulations in the converse direction: binary daglike MP-PCR (a dynamic version of MP-NSR) polynomially simulates L&P; it also polynomially simulates CP when division axioms are added.
Karp and Lipton proved that if $NP\subseteq P/poly$, then $PH$ collapses. A long line of work pushed the collapse to smaller classes. In particular, Chakaravarthy and Roy obtained two such collapses, to (apparently) incomparable classes $O_2^P$ and $P^{prMA}$. We united them earlier by a collapse to the input-oblivious version $P^{prOMA}$ of $P^{prMA}$, which is contained in both; and, jointly with Williams, to a slightly smaller class. Two other deepest known collapses are to $ZPP^{ONP}$ (following from Köbler and Watanabe) and to $OL_2^P$ (proved in this paper). We unite the three collapses by a collapse to a class contained in all of them. We use a three-stage computational model OGTD (oblivious generator-tester-decoder): a polynomial-time generator with an oracle computes an advice string from $1^n$, a tester certifies it, and a polynomial-time decoder uses it (it is the only one that sees the actual input). Let $OM$ be the class of OGTD languages defined by a restricted version of $prOMA$ as the generator's oracle, by a co-$ONP$ tester, and a $P$ decoder. We show that it is contained in the three collapse classes above and prove that $PH$ collapses to $OM$ under $NP\subseteq P/poly$. The collapse also holds for an unambiguous version of $OM$. All these input-oblivious collapse classes lie in $P^{prSBP}$, and so do even the non-input-oblivious versions $P^{prMA}$, $L_2^P$ and $S_2^P$: we prove that $P^{prS_2^P}\subseteq P^{prSBP}$. This strengthens the containment $S_2^P\subseteq P^{prAM}$ of Chakaravarthy and Roy and our earlier containment $L_2^P\subseteq P^{prSBP}$. The proof unites the Goldreich-Wigderson-type procedure of Chakaravarthy and Roy with our earlier approximate-counting technique. Its input-oblivious counterpart concerns $O_2^P$, the first collapse class of Chakaravarthy and Roy: every language in $O_2^P$ has polynomial-size circuits constructible in $FP^{prSBP}$.