Based on a variation of the pigeon hole principle,
we propose a propositional formula having a unique satisfying assignment
and prove an exponential lower bound
for computing each bit of its satisfying by the tree-like resolution.
Our proof is obtained
by following the outline proposed
by Ben-Sasson and Wigderson (1999).