Complexity Considerations, cSAT problem lower bound

This article considers lower bound understood as worst case minimal amount of time required to calculate problem result for cSAT (Counted Boolean Satisfiability Problem). It uses observation that Boolean Algebra is complete First Order Theory where every sentence is decidable. Lower bound of this decidability is defined and shown. This article shows that deterministic calculation model built of finite number of machines (algorithms), oracles, axioms or predicates is incapable of solving considered NP-complete problem when its instance grows to infinity. This is direct proof that P and NP complexity classes differ and oracle capable of solving NP-complete problems in polynomial time must consist of infinite number of objects (must be nondeterministic). Corollary of this paper clears complexity hierarchy: P < NP