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.
[Skip to Readme]
Modules
[Index]
Downloads
- twee-0.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
For package maintainers and hackage trustees
Candidates
- No Candidates
Versions [RSS] | 0.1, 2.0, 2.1, 2.1.1, 2.1.2, 2.1.3, 2.1.4, 2.1.5, 2.2, 2.3, 2.3.1, 2.4, 2.4.1, 2.4.2, 2.5 |
---|---|
Dependencies | array, base (>=4 && <5), containers, dlist, ghc-prim, heaps, jukebox (==0.2.17), pretty, primitive, reflection, split, transformers, twee [details] |
License | BSD-3-Clause |
Author | Nick Smallbone |
Maintainer | nicsma@chalmers.se |
Revised | Revision 1 made by NickSmallbone at 2018-02-09T21:46:36Z |
Category | Theorem Provers |
Home page | http://github.com/nick8325/twee |
Source repo | head: git clone git://github.com/nick8325/twee.git -b master |
Uploaded | by NickSmallbone at 2016-03-02T17:19:03Z |
Distributions | |
Reverse Dependencies | 1 direct, 0 indirect [details] |
Executables | twee |
Downloads | 5569 total (1 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs available [build log] Last success reported on 2016-11-27 [all 1 reports] |