automated theorem proving

Some Experiments with Twee-Style Goal-Directedness

arXiv:2607.27442

summary

The paper extends the Twee approach of preferring clauses that share terms with the conjecture to full first-order saturation-based theorem proving, proposing a shared-term implementation that yields promising performance.

Abstract

In saturation-based theorem proving, selecting the next clause for processing is a major concern. Twee has successfully applied the idea of preferring clauses that share terms with the conjecture by adding equational definitions to transform the problem. In this paper, we apply the idea to the full first-order case, and offer an alternative implementation based on shared terms. Both approaches have complementary applications and show very promising results.

Updated with more data and fixed a lot of typos

Topics & keywords

#clause selection#saturation-based proving#goal-directedness#first-order logic#term sharingsaturationclause selectiongoal-directedfirst-order logicequational definitionstheorem proving
Some Experiments with Twee-Style Goal-Directedness · wovepaper