All about Tree-like Cutting Planes

Proof Systems

• Tree-like Cutting Planes does not simulate Resolution
• Source: Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes simulates Truth table
• Source: tlCP → tlRes → ttp
• Tree-like Cutting Planes simulates Tree-like resolution
• Source: [citation needed]
• Tree-like Cutting Planes does not simulate Regular resolution
• Source: regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes incomparable wrt Ordered resolution
• Source: tlCP → tlRes → pearl → ordRes
• Source: ordRes → peb+ind → tlCP
• Tree-like Cutting Planes does not simulate Pool resolution
• Source: poolRes → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes [missing?] Linear resolution
• Tree-like Cutting Planes [missing?] Reversible resolution
• Tree-like Cutting Planes weaker than Cutting Planes
• Source: [subsystem]
• Source: CP → uCP → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes does not simulate Cutting Planes with Unary Coefficients
• Source: uCP → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes weaker than Semantic Cutting Planes
• Source: semanticCP → CP → tlCP
• Source: semanticCP → CliqueColouringeq → CP → tlCP
• Tree-like Cutting Planes does not simulate Cutting Planes with Saturation
• Source: saturationCP → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes weaker than Stabbing Planes
• Source: SP → CP → tlCP
• Source: SP → uSP → uCP → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes does not simulate Stabbing Planes with Unary Coefficients
• Source: uSP → uCP → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes weaker than Res(CP)
• Source: Res(CP) → CP → tlCP
• Source: Res(CP) → CP → uCP → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes does not simulate Res(LP)
• Source: Res(LP) → uRes(LP) → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes does not simulate Res(CP) with unary coefficients
• Source: uRes(CP) → uCP → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes does not simulate Res(LP) with unary coefficients
• Source: uRes(LP) → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes does not simulate Res(L\(\&\)P)
• Source: Res(L&P) → Res(LP) → uRes(LP) → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes does not simulate Res(L\(\&\)P) with unary coefficients
• Source: uRes(L&P) → uRes(LP) → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes simulated by Semantic degree-k threshold system, treelike version
• Source: [subsystem]
• Tree-like Cutting Planes does not simulate Polynomial Calculus over \(\mathbb{F}_2\)
• Source: PC_F2 → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes does not simulate Nullstellensatz over \(\mathbb{F}_2\)
• Source: NS_F2 → ts+ind → CP → tlCP
• Tree-like Cutting Planes does not simulate ResLin over \(\mathbb{Q}\), ResLin, Resolution over linear equations over rationals
• Source: ResLin_Z → uResLin_Z → ResLin_F2 → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes does not simulate unary ResLin over \(\mathbb{Q}\), ResLin, Resolution over linear equations over rationals
• Source: uResLin_Z → ResLin_F2 → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes does not simulate ResLin over \(\mathbb{F}_2\), Res(\(\oplus\))
• Source: ResLin_F2 → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes [missing?] Tree-like ResLin over \(\mathbb{F}_2\), treelike Res(\(\oplus\))
• Tree-like Cutting Planes does not simulate Polynomial Calculus over \(\mathbb{Q}\)
• Source: PC_Q → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes does not simulate Nullstellensatz over \(\mathbb{Q}\)
• Source: NS_Q → tsQ+ind → CP → tlCP
• Tree-like Cutting Planes simulates Hitting
• Source: tlCP → tlRes → hit
• Tree-like Cutting Planes does not simulate Lift and Project
• Source: L&P → uL&P → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes does not simulate Lift and Project with unary coefficients
• Source: uL&P → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes does not simulate Positivstellensatz Calculus
• Source: PSC → PS → SoS → sLSn+ → CliqueColouring → CP → tlCP
• Tree-like Cutting Planes does not simulate Positivstellensatz
• Source: PS → SoS → sLSn+ → CliqueColouring → CP → tlCP
• Tree-like Cutting Planes does not simulate Lovász--Schrijver (LS)
• Source: LS → L&P → uL&P → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes does not simulate Lovász--Schrijver with squares (LS\(_+\))
• Source: LS+ → LS → L&P → uL&P → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes does not simulate Lovász--Schrijver with squares (LS\(_+^d\)), bounded degree
• Source: LSd+ → CliqueColouring → CP → tlCP
• Tree-like Cutting Planes does not simulate Lovász--Schrijver with squares (LS\(_+^\infty\)), unbounded degree
• Source: LSn+ → LSd+ → CliqueColouring → CP → tlCP
• Tree-like Cutting Planes weaker than Cone Proof System
• Source: CPS → IPS → extFrege → Frege → CP → tlCP
• Source: CPS → LSn+ → LSd+ → CliqueColouring → CP → tlCP
• Tree-like Cutting Planes [missing?] tl Lovász--Schrijver (LS)
• Tree-like Cutting Planes [missing?] Lovász--Schrijver with squares (LS\(_+\))
• Tree-like Cutting Planes [missing?] Lovász--Schrijver with squares (LS\(_+^d\)), bounded degree, treelike
• Tree-like Cutting Planes [missing?] static Lovász--Schrijver (static LS)
• Tree-like Cutting Planes [missing?] static Lovász--Schrijver, with squares of linear functions (static LS\(_+\))
• Tree-like Cutting Planes does not simulate static Lovász--Schrijver, with squares of linear functions (static LS\(_+^n\))
• Source: sLSn+ → CliqueColouring → CP → tlCP
• Tree-like Cutting Planes does not simulate Sum of Squares (Lasserre)
• Source: SoS → sLSn+ → CliqueColouring → CP → tlCP
• Tree-like Cutting Planes does not simulate Sherali--Adams
• Source: SA → circRes → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes does not simulate Circular resolution
• Source: circRes → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes [missing?] Unary Sherali--Adams
• Tree-like Cutting Planes weaker than Ideal Proof System
• Source: IPS → extFrege → Frege → CP → tlCP
• Source: IPS → extFrege → extRes → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes weaker than Extended Frege
• Source: extFrege → Frege → CP → tlCP
• Source: extFrege → extRes → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes weaker than Extended resolution
• Source: extRes → extFrege → Frege → CP → tlCP
• Source: extRes → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes weaker than Frege
• Source: Frege → CP → tlCP
• Source: Frege → AC0Frege → Res-k → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes does not simulate \(\mathrm{AC}^0\)-Frege
• Source: AC0Frege → Res-k → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes does not simulate k-DNF Resolution
• Source: Res-k → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes weaker than \(\mathrm{TC}^0\)-Frege
• Source: TC0Frege → Res(CP) → CP → tlCP
• Source: TC0Frege → AC0Frege → Res-k → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes does not simulate \(\mathrm{AC}^0\)-Frege with mod 2 axioms
• Source: AC0Frege+Mod2axioms → AC0Frege → Res-k → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes does not simulate \(\mathrm{AC}^0\)-Frege with mod 2 gates
• Source: AC0(+)Frege → ResLin_F2 → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes does not simulate OBDD(join,weakening)
• Source: OBDDjoinweak → CliqueColouring → CP → tlCP
• Tree-like Cutting Planes weaker than LK
• Source: LK → Frege → CP → tlCP
• Source: LK → Frege → AC0Frege → Res-k → Res → regRes → ordRes → peb+ind → tlCP
• Tree-like Cutting Planes weaker than Zermelo-Fraenkl Set Theory with the Axiom of Choice
• Source: ZFC → Res(CP) → CP → tlCP
• Source: ZFC → extFrege → extRes → Res → regRes → ordRes → peb+ind → tlCP

Formulas

• The size complexity of Pigeonhole principle in Tree-like Cutting Planes is [missing?]
• The size complexity of Pigeonhole principle with functionality axioms in Tree-like Cutting Planes is [missing?]
• The size complexity of Pigeonhole principle with functionality and onto axioms in Tree-like Cutting Planes is [missing?]
• The size complexity of Weak pigeonhole principle (2n pigeons, n holes) in Tree-like Cutting Planes is [missing?]
• The size complexity of Weak pigeonhole principle (\(n^2\) pigeons, n holes) in Tree-like Cutting Planes is [missing?]
• The size complexity of Bitwise pigeonhole principle in Tree-like Cutting Planes is exponential
• Source: bPHP → CP → tlCP
• The size complexity of Relativized pigeonhole principle (n,\(n^2\),n-1) in Tree-like Cutting Planes is [missing?]
• The size complexity of Ordering principle in Tree-like Cutting Planes is [missing?]
• The size complexity of Guarded ordering principle in Tree-like Cutting Planes is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) in Tree-like Cutting Planes is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Tree-like Cutting Planes is exponential
• Source: tseitin-and-k → tlTH(k) → tlCP
• The size complexity of Tseitin over \(\mathbb{Q}\) in Tree-like Cutting Planes is [missing?]
• The size complexity of Flow in Tree-like Cutting Planes is [missing?]
• The size complexity of Tseitin \(\mathbb{F}_2\) \(\circ\) IND in Tree-like Cutting Planes is exponential
• Source: ts+ind → CP → tlCP
• The size complexity of Tseitin \(\mathbb{Q}\) \(\circ\) IND in Tree-like Cutting Planes is exponential
• Source: tsQ+ind → CP → tlCP
• The size complexity of Random CNF in Tree-like Cutting Planes is [missing?]
• The size complexity of Clique-Colouring in Tree-like Cutting Planes is exponential
• Source: CliqueColouring → CP → tlCP
• The size complexity of Clique-Colouring encoded as equalities in Tree-like Cutting Planes is exponential
• Source: CliqueColouringeq → CP → tlCP
• The size complexity of Weak Clique-Colouring (2m clique, m colours) in Tree-like Cutting Planes is exponential
• Source: CliqueColouring2mm → CP → tlCP
• The size complexity of Weak Clique-Colouring (m^1/2 clique, log^2 m colours) in Tree-like Cutting Planes is superpolynomial
• Source: CliqueColouringmlogm → CP → tlCP
• The size complexity of Clique-Colouring composed with a permutation in Tree-like Cutting Planes is [missing?]
• The size complexity of Pebbling \(\circ\) IND in Tree-like Cutting Planes is exponential
• Source: BEGJ00 On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems.
• The size complexity of Pebbling \(\circ\) XOR, then guarded in Tree-like Cutting Planes is [missing?]
• The size complexity of Stone formula in Tree-like Cutting Planes is [missing?]
• The size complexity of String of pearls in Tree-like Cutting Planes is at most quasipolynomial
• Source: tlCP → tlRes → pearl
• The size complexity of Sink of DAG \(\circ\) XOR in Tree-like Cutting Planes is [missing?]

This database is still incomplete; missing data may indicate either the information was not yet recorded or an open problem. Users are encouraged to contribute missing proof systems and/or relations at https://gitlab.com/proofcomplexityzoo/zoo.

Licensed under CC BY 4.0