Automated Inference of Finite Unsatisfiability
We present Infinox, an automated tool for analyzing first-order logic problems, aimed at showing finite unsatisfiability, i.e. the absence of models with finite domains. Finite satisfiability is a semi-decidable problem, which means that such a tool can never be complete. Nevertheless, our hope is that Infinox be a complement to finite model finders in practice. The implementation consists of several different proof techniques for showing infinity of a set, each of which requires the identification of a function or a relation with particular properties. Infinox enumerates candidates to such functions and relations, and subsequently uses an automated theorem prover as a sub-procedure to try to prove the resulting proof obligations. We have evaluated Infinox on the relevant problems from the TPTP benchmark suite, with very promising results.
Unable to display preview. Download preview PDF.
- 1.Claessen, K., Sörensson, N.: New techniques that improve MACE-style model finding. In: Proc. of Workshop on Model Computation (MODEL) (2003)Google Scholar
- 3.McCune, W.: Prover9 and Mace4 (2006), http://www.cs.unm.edu/~mccune/mace4/
- 7.Sutcliffe, G.: TSTP – thousands of solutions of theorem provers (2008), http://www.tptp.org/TSTP
- 8.The SPASS Team. The Spass theorem prover (2007), http://www.spass-prover.org/
- 9.Vännännen, J.: A Short course on finite model theory, Department of Mathematics, University of Helsinki (2006)Google Scholar