A group of CMU researchers successfully implemented a BMC by using solvers for this problem. Identifying common assignments and recursively applying the branch-merge rule to solve this problem is the focus of Stalmarck’s method. Programs that solve this problem (15[1])often use DPLL algorithms. A common way to reduce this problem is to use (-5[1])the (15[1])Tseytin transformation (0[1])to change a formula to its (*) conjunctive normal form. Richard Karp’s proof inspired the Cook-Levin theorem, which states that this problem is NP-complete. This problem (10[1])often features clauses that contain up to three literals but can be generalized to any number of literals in its “k-” form. For 10 points, name this problem that decides if there exists a set of boolean values that makes a formula true. ■END■