We present another proof
for an upper bound of a deterministic local search algorithm
Dantsin et. al. for 3-SAT.
This bound $O(1.481^n)$ is currently no longer the best
(where $n$ is the number of variables)
while the best bound is slightly better: $O(1.473^n)$
due to Brueggemann and Kern.