HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.
Abstract
An artificially designed Turing Machine algorithm $\mathbf{M}_{}^{o}$ generates the instances of the satisfiability problem, and check their satisfiability. Under the assumption $\mathcal{P}=\mathcal{NP}$, we show that $\mathbf{M}_{}^{o}$ has a certain property, which, without the assumption, $\mathbf{M}_{}^{o}$ does not have. This leads to $\mathcal{P}\neq\mathcal{NP}$ $ $ by modus tollens.
arXiv comments
7 pages. Caution: this solution should not be reported to be correct while this caution stands. Actually, it is quite unlikely that this simple solution is correct. I am sharing this e-print to get comments on the probable mistake that I could not have found yet. If you have a conceptual grasp on Cooks Theory and some related glossaries then there will be no difficulty in reading this paper