  Using Maple, we implement a SAT solver based on the principle of
inclusion-exclusion and the Bonferroni inequalities. Using randomly generated
input, we investigate the performance of our solver as a function of the number
of variables and number of clauses. We also test it against Maple's built-in
tautology procedure. Finally, we implement the Lov\'asz local lemma with Maple
and discuss its applicability to SAT.
