The twee package

[Tags:bsd3, library, program]

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.


[Skip to Readme]

Properties

Versions 0.1
Dependencies array, base (==4.*), containers, dlist, ghc-prim, heaps, jukebox (>=0.2), pretty, primitive, reflection, split, transformers, twee [details]
License BSD3
Author Nick Smallbone
Maintainer nicsma@chalmers.se
Category Theorem Provers
Home page http://github.com/nick8325/twee
Source repository head: git clone git://github.com/nick8325/twee.git -b master
Uploaded Wed Mar 2 17:19:03 UTC 2016 by NickSmallbone
Distributions NixOS:0.1
Downloads 81 total (3 in the last 30 days)
Votes
0 []
Status Docs available [build log]
Last success reported on 2016-11-27 [all 1 reports]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Readme for twee

Readme for twee-0.1

This is twee, a prover for equational problems.

To install, run cabal install.

Afterwards, invoke as 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 types and quantifiers.

Twee is experimental software, use at your own risk!