Answers are grounded in this paper and cite their sources.
For every choice of positive integers c and k such that k ≥ 3 and c 2 - k ≥ 0.7, there is a positive number ε such that, with probability tending to 1 as n tends to ∞, a randomly chosen family of cn clauses of size k over n variables is unsatisfiable, but every resolution proof of its unsatisfiability must generate at least (1 + ε) n clauses.
No takes yet. Share an insight, caveat, or question.
Chvátal et al. (1988) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: