Efficient Model Generation through Compilation

AbstractWe present a collection of simple but powerful techniques for enhancing the efficiency of tableau-based model generators such as Satchmo. The central ideas are to compile a clausal first order theory into a procedural Prolog program and to avoid redundant work of a naı̈ve implementation. We have compared various combinations of our techniques among each other and with theorem provers based on various calculi, using the TPTP problem library as a benchmark. Our implementation has turned out to be the most efficient for range-restricted problems and for a class of problems we call nonnesting