SAT is NP-completemathsStatement Cook-Levin Theorem (1971)The Satisfiability problem is NP-complete.ProofThis is long.