  This paper depicts algorithms for solving the decision Boolean Satisfiability
Problem. An extreme problem is formulated to analyze the complexity of
algorithms and the complexity for solving it. A novel and easy reformulation as
a lottery for an extreme case is presented to determine a stable complexity
around $2^n$. The reformulation point out that the decision Boolean
Satisfiability Problem can only be solved in exponential time. This implies
there is not an efficient algorithm for the NP Class.
