
We describe an explicit family of contradictory reordered-parity formulas and reconstruct it as a bounded-degree Tseitin contradiction. The construction gives regular-resolution refutation size 2^Omega(sqrt(N)) and unrestricted general-resolution width Omega(sqrt(N)), while also documenting why the standard size-width route does not yield unrestricted general-resolution size for this grid-like family.
Draft preprint deposit. The reserved DOI becomes active only when the Zenodo record is published.
Tseitin formulas, reordered parity, proof complexity, treewidth, resolution, SAT, regular resolution
Tseitin formulas, reordered parity, proof complexity, treewidth, resolution, SAT, regular resolution
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
