154KiB, 1080x1370, 78edcba2b3be21a5c472da94ef67a32e8cce235bfddab3c54ae052939d7a4a7a_1.jpg
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.
