Question: np does not equal p?
Answer: NP-hard problems need not be in NP, i.e., they need not have solutions verifiable in polynomial time. ... If any NP-complete problem is in P, then it would follow that P = NP. However, many important problems have been shown to be NP-complete, and no fast algorithm for any of them is known.