The funny thing is that all these "solutions" are implications but not proof, and one contrary demonstration would actually render them all irrelevant as far as I understand the theory of computational p v np time complexity