MACE 2.0 Reference Manual and Guide [article]

William McCune
2001 arXiv   pre-print
MACE is a program that searches for finite models of first-order statements. The statement to be modeled is first translated to clauses, then to relational clauses; finally for the given domain size, the ground instances are constructed. A Davis-Putnam-Loveland-Logeman procedure decides the propositional problem, and any models found are translated to first-order models. MACE is a useful complement to the theorem prover Otter, with Otter searching for proofs and MACE looking for countermodels.
arXiv:cs/0106042v1 fatcat:bz6en24snverjirxcnxx4duwpi