On Bounded Depth Proofs for Tseitin Formulas on the Grid; Revisited

We study Frege proofs using depth-d Boolean formulas for the Tseitin contradiction on n \times n grids. We prove that if each line in the proof is of size M, then the number of lines is exponential in n/(log M)O(d). This strengthens a recent result of Pitassi, Ramakrishman, and Tan [2022 IEEE 62nd Annual Symposium on Foundations of Computer Science, 2022, pp. 445-456]. The key technical step is a multiswitching lemma extending the switching lemma of H\rastad [J. ACM, 68 (2021), 1] for a space of restrictions related to the Tseitin contradiction. The strengthened lemma also allows us to improve the lower bound for standard proof size of bounded depth Frege refutations from exponential in \Omega(\~ n1/59d) to exponential in \Omega(\~ n1/d). This strengthens the bounds given in the preliminary version of this paper [J. H\rastad and K. Risse, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science, 2022, pp. 1138-1149].