The Boolean satisfiability problem determines whether a given conjunctive normal form formula has an assignment of Boolean variables that evaluates to true