Under the auspices of the Computational Complexity Foundation (CCF)
We prove that, with high probability, the space complexity of refutinga random unsatisfiable boolean formula in $k$-CNF on $n$variables and $m = \Delta n$ clauses is $O(n \cdot \Delta^{-\frac{1}{k-2}})$.
