Given a propositional formula $\varphi$, the Boolean Satisfiability Problem asks whether there exists a model such that the formula evaluates to true.