Definition:Boolean Satisfiability Problem/Example

Example
If $L$ is the set of propositional formulas given by:
 * $\neg x_1 \lor \neg x_2$
 * $x_3$
 * $x_3 \implies x_2$

then a solution to the boolean satisfiability problem for $L$ is:
 * $x_1 = \operatorname{False}$
 * $x_2 = \operatorname{True}$
 * $x_3 = \operatorname{True}$