Exponential complexity of an adiabatic algorithm for an NP-complete problem

We prove an analytical expression for the size of the gap between the ground and the first excited state of quantum adiabatic algorithm for the 3-satisfiability, where the initial Hamiltonian is a projector on the subspace complementary to the ground state. For large problem sizes the gap decreases exponentially and as a consequence the required running time is also exponential. Asymptotically the algorithm has the same complexity as searching in an unstructured database