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 https://www.tptp.org). You can use types and quantifiers, but apart from that the problem must be equational.

---

[Skip to Readme]

Flags

Manual Flags

Name	Description	Default
static	Build a static binary.	Disabled
parallel	Build a special parallel version of Twee.	Disabled
rtsopts	Enable -rtsopts (e.g. for setting maximum memory use.)	Disabled

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

Downloads

• twee-2.7.1.tar.gz [browse] (Cabal source package)
• Package description (revised from the package)

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

Package maintainers

• NickSmallbone

For package maintainers and hackage trustees

• edit package information

Candidates

• No Candidates