A Negative Answer to $P\overset{?}{=}PSPACE$

There is a conjecture on $P\overset{?}{=}PSPACE$ in computational complexity zoo. It is a widespread belief that $P\neq PSPACE$, otherwise $P=NP$ which is extremely impossible. In this short work, we assert that $P\neq PSPACE$ no matter what outcome is on $P\overset{?}{=}NP$. We accomplishe this via showing $NP\neq PSPACE$. The method is by the result that Circuit-SAT$\in DSPACE[n]$ and the known result $DSPACE[n]\subset DSPACE[n^2]$ by the space complexity hierarchy theorem. Closely related consequences are summarized.