The polynomial algorithm for 3-SAT problem (or P=NP)
I don't think one example constitutes a conclusion.  While demonstrating the nonexistance of an algorithm for 3-SAT problem would prove P!=NP, the existance of an algorithm merely means "Move along, let's try a different difficult algorithm"