Introduction - If you have any usage issues, please Google them yourself
Function Davis Putnam(φ: CNF formula) : Boolean
Unit Propagation(φ)
Pure Literal Rule(φ)
ifφ= φ then returntrue
if□ ∈φthen returnfalse
l←literal in c ∈φhaving c the minimum length
RL←all possible non-tautological resolvent clauses between all clauses in
CLand all clauses in CĹ
return Davis Putnam(φ∪ RL\ (CL ∪ CĹ ))