  The paper contains a proof for the P != NP hypothesis with the help of the
two "natural" postulates. The postulates restrict capacity of the Turing
machines and state that each independent and necessary condition of the problem
should be considered by a solver (Turing machine) individually, not in groups.
That is, a solver should spend at least one step to deal with the condition
and, therefore, if the amount of independent conditions is exponentially
growing with polynomially growing problem sizes then exponential time is needed
to find a solution. With the postulates, it is enough to build a natural (not
pure mathematical) proof that P != NP.
