The claim is that since clique is in NP-complete and not P, P != NP. (Every problem in P is in NP.)