I believe that P != NP. But suppose someone finds a way to provably solve SAT in O(n**1000000), thus proving P = NP. It's polynomial, but still unusable for real problems.
Edit: fixing damage to my post by Hacker News, making people think I don't understand O-notation.