twee

An equational theorem prover.

Twee is an experimental equational theorem prover based on Knuth-Bendix completion.

Given a set of equational axioms and a set of equational conjectures it will try to prove the conjectures. It will terminate if the conjectures are true but normally fail to terminate if they are false.

The input problem should be in TPTP format (see http://www.tptp.org). You can use types and quantifiers, but apart from that the problem must be equational.

This is twee, an equational theorem prover.

The version in this git repository is likely to be unstable! To install the latest stable version, run:

cabal install twee

If you have LLVM installed, you can get a slightly faster version by running:

cabal install twee -fllvm

If you really want the latest unstable version, run cabal install src/ . in this repository.

Afterwards, run twee nameofproblem.p. The problem should be in TPTP format (http://www.tptp.org). You can find a few examples in the tests directory. All axioms and conjectures must be equations, but you can freely use quantifiers. If it succeeds in proving your problem, twee will print a human-readable proof.

For the official manual, see http://nick8325.github.io/twee.