(A) $\rightarrow$ FALSE: All class $P$ problems are subset of $NP$ and have Deterministic polynomial time algorithm.
(B) $\rightarrow$ FALSE: $P$ is subset of $NP$.
(C) $\rightarrow$ TRUE: $NP$ is not a subset of $P$. If NP is a subset of $P$ then $P=NP$ contradicts the assumption $P \neq NP$.
(D) $\rightarrow$ FALSE: $P$ is not subset of $NP$.