SAT problem

(refer to Boaz Barak and Sanjeev Arora, 2009 chapter 2.3.1 boolean formulas, CNF, and SAT) the SAT problem is an example of an NP-complete problem.