Representing a proof tree by a combinator term that reduces to the tree lets subtle forms of
duplication within the tree materialize as duplicated subterms of the combinator term. In a …

CD Tools is a Prolog library for experimenting with condensed detachment in first-order ATP,
which puts a recent formal view centered around proof structures into practice. From the …

We propose a new encoding of the first-order connection method as a Boolean satisfiability
problem. The encoding eschews tree-like presentations of the connection method in favour …

This paper gives a comprehensive overview of the automated theorem prover leanCoP and
all its variants for classical and non-classical first-order logics that have been developed so …

Linear resolution is one of the ancient methods for first-order theorem proving. We extend
linear resolution with clause splitting, producing subgoals dispatched independently. An …

1 Background Goal-driven first-order provers such as leanCoP [14] or SETHEO [9], which
may described as based on clausal tableaux [8], the connection method [1, 3] or model …