Inquiry of P-reduction in Cook's 1971 Paper -- from Oracle machine to Turing machine

In this paper, we inquire the key concept P-reduction in Cook's theorem and reveal that there exists the fallacy of definition in P-reduction caused by the disguised displacement of NDTM from Oracle machine to Turing machine. The definition or derivation of P-reduction is essentially equivalent to Turing's computability. Whether NP problems might been reduced to logical forms (tautology or SAT) or NP problems might been reduced each other, they have not been really proven in Cook's 1971 paper.