$\mathcal{P}\neq \mathcal{NP}$

In this article, we discuss the $\mathcal{NP}$ problem, we do not follow the line of research of many researchers, which is to try to find such an instance Q, and the instance Q belongs to the class of $\mathcal{NP}$-complete, if the instance Q is proved to belong to $\mathcal{P}$, then $\mathcal{P}$ and $\mathcal{NP}$ are the same, if the instance Q is proved not to belong to $\mathcal{P}$, then $\mathcal{P}$ and $\mathcal{NP}$ are separated. Our research strategy in this article: Select an instance S of $\mathcal{EXP}$-complete and reduce it to an instance of $\mathcal{NP}$ in polynomial time, then S belongs to $\mathcal{NP}$, so $\mathcal{EXP} = \mathcal{NP}$, and then from the well-known $\mathcal{P} \neq \mathcal{EXP}$, derive $\mathcal{P} \neq \mathcal{NP}$.