If you mean by "solve" solve in polynomial-time, then that would show that P=NP. Indeed, if we find a deterministic polynomial-time algorithm for any NP-complete problem, then we just prove that P=NP.
Thanks for the response, u r right..I am talking about solving in polynomial time. However, I am after the change of mindset that the result would bring. Because everyone would probably try to solve the remaining problems from NP Complete class in polynomial time.