Has anyone proven that NP Complete problems can not be solved quickly?

Isn't it the holy grail of computer science to solve all NP complete problems quickly?

http://en.wikipedia.org/wiki/NP-complete

Once thats figured out, maybe AI will be easier to attain.