It is introduced a so called 'Multi-stage graph Simple Path' problem (MSP for short) and proved that SAT problem can be polynomial reducible to MSP problem in this small paper. To solve MSP problem, we propose a polynomial time algorithm. Our result implies NP=P.

翻译：它被引入了所谓的“多阶段图形简单路径”问题(MSP简称MSP ), 并证明SAT问题可以在这份小文件中为MSP问题提供多级缩写。 为了解决MSP问题, 我们建议采用一个多级时间算法。 我们的结果意味着NP=P 。