Hard examples for the bounded depth Frege proof system

AbstractWe prove exponential lower bounds on the size of a bounded depth Frege proof of a Tseitin graph-based contradiction, whenever the underlying graph is an expander. This is the first example of a contradiction, naturally formalized as a 3-CNF, that has no short bounded depth Frege proofs. Previously, lower bounds of this type were known only for the pigeonhole principle and for Tseitin contradictions based on complete graphs.Our proof is a novel reduction of a Tseitin formula of an expander graph to the pigeonhole principle, in a manner resembling that done by Fu and Urquhart for complete graphs.In the proof we introduce a general method for removing extension variables without significantly increasing the proof size, which may be interesting in its own right.

[1]  Robin Thomas,et al.  A separator theorem for graphs with an excluded minor and its applications , 1990, STOC '90.

[2]  Jan Krajícek,et al.  Proof complexity in algebraic systems and bounded depth Frege systems with modular counting , 1997, computational complexity.

[3]  Toniann Pitassi,et al.  An exponential separation between the matching principle and the pigeonhole principle , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[4]  Dima Grigoriev,et al.  Tseitin's tautologies and lower bounds for Nullstellensatz proofs , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[5]  Samuel R. Buss,et al.  Linear gaps between degrees for the polynomial calculus modulo distinct primes , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[6]  Endre Szemerédi,et al.  Many hard examples for resolution , 1988, JACM.

[7]  Stephen A. Cook,et al.  The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.

[8]  Johan Håstad,et al.  Almost optimal lower bounds for small depth circuits , 1986, STOC '86.

[9]  Toniann Pitassi,et al.  Approximation and Small-Depth Frege Proofs , 1992, SIAM J. Comput..

[10]  Alasdair Urquhart,et al.  Formal Languages]: Mathematical Logic--mechanical theorem proving , 2022 .

[11]  Eli Ben-Sasson,et al.  Random Cnf’s are Hard for the Polynomial Calculus , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[12]  Jan Krajícek,et al.  Exponential Lower Bounds for the Pigeonhole Principle , 1992, STOC.

[13]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[14]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

[15]  Jan Krajícek,et al.  An Exponenetioal Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle , 1995, Random Struct. Algorithms.

[16]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[17]  Alasdair Urquhart,et al.  The Complexity of Propositional Proofs , 1995, Bulletin of Symbolic Logic.

[18]  Miklós Ajtai,et al.  The complexity of the Pigeonhole Principle , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[19]  Alasdair Urquhart,et al.  Simplified Lower Bounds for Propositional Proofs , 1996, Notre Dame J. Formal Log..

[20]  Eli Ben-Sasson,et al.  Short proofs are narrow—resolution made simple , 2001, JACM.

[21]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .