Published May 14, 2026
| Version v0.1.0-preprint
Preprint
Open
An Explicit Reordered-Parity Family with Regular-Resolution Size and General-Resolution Width Lower Bounds
Description
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.
Notes
Draft preprint deposit. The reserved DOI becomes active only when the Zenodo record is published.
Files
v0.1.0-preprint-zenodo.zip
Files
(493.6 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:405b643dcc682b9c84ed20f2b10380e5
|
256.5 kB | Preview Download |
|
md5:c2ac4e6a716bf095e531737cea94b836
|
237.1 kB | Preview Download |
Additional details
References
- Ben-Sasson, E. and Wigderson, A. (2001). Short Proofs Are Narrow--Resolution Made Simple. Journal of the ACM, 48(2), 149--169. https://doi.org/10.1145/375827.375835
- Urquhart, A. (1987). Hard Examples for Resolution. Journal of the ACM, 34(1), 209--219. https://doi.org/10.1145/7531.8928
- Itsykson, D., Riazanov, A., and Smirnov, P. (2022). Tight Bounds for Tseitin Formulas. SAT 2022. https://doi.org/10.4230/LIPIcs.SAT.2022.6
- Harvey, D. J. and Wood, D. R. (2018). The Treewidth of Line Graphs. Journal of Combinatorial Theory, Series B, 132, 157--179. https://doi.org/10.1016/j.jctb.2018.03.001
- Atserias, A., Fichte, J. K., and Thurley, M. (2011). Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution. Journal of Artificial Intelligence Research, 40, 353--373. https://doi.org/10.1613/jair.3152