twee: An equational theorem prover

[ bsd3, program, theorem-provers ] [ Propose Tags ]

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.

Flags

Automatic Flags
NameDescriptionDefault
static

Build a static binary.

Disabled
static-cxx

Build a binary which statically links against libstdc++.

Disabled
llvm

Build using LLVM backend for faster code.

Disabled

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

Downloads

Maintainer's Corner

Package maintainers

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
Dependencies base (<5), containers, jukebox (>=0.3.2), pretty, split, twee-lib (==2.1) [details]
License BSD-3-Clause
Author Nick Smallbone
Maintainer nicsma@chalmers.se
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 2018-02-07T23:14:45Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Executables twee
Downloads 5158 total (31 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
Last success reported on 2018-02-08 [all 3 reports]