p=np

No.12087474 ViewReplyOriginalReport
I have managed to solve the 3Sat in deterministic machine with polinomiale time. I have managed to do so by assuming Np to be a subset of P, and the proof followed soon after.