A program isn't a proof. It's perfectly possible to solve restricted cases of an NP-problem in polynomial time. Doing so in enough of the test cases people throw at it to fool people for a while would itself be a huge accomplishment, but it would still be entirely possible that P != NP while I'm holding a program that has solved every NP problem I have thrown at it in P time (especially if that P is large).