homepage: http://github.com/nick8325/twee
changelog-type: ''
hash: f12df51c8f4eb6206590f7d3da1b1681a56feccde9674cd05a1c340d74312f1d
test-bench-deps: {}
maintainer: nicsma@chalmers.se
synopsis: An equational theorem prover
changelog: ''
basic-deps:
  jukebox: ! '>=0.3'
  split: -any
  base: ==4.*
  twee: -any
  dlist: -any
  containers: -any
  ghc-prim: -any
  transformers: -any
  pretty: -any
  primitive: ! '>=0.6.2.0'
all-versions:
- '0.1'
- '2.0'
author: Nick Smallbone
latest: '2.0'
description-type: text
description: ! '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!

'
license-name: BSD3

homepage: http://github.com/nick8325/twee
changelog-type: ''
hash: 5f4d4fd5dad97ee4f2ccfbebabbc2ef59ecbae75b7a24bbedcb2d2e811187a54
test-bench-deps: {}
maintainer: nicsma@chalmers.se
synopsis: An equational theorem prover
changelog: ''
basic-deps:
  jukebox: ! '>=0.3.2'
  split: -any
  base: <5
  twee-lib: ==2.1
  containers: -any
  pretty: -any
all-versions:
- '0.1'
- '2.0'
- '2.1'
author: Nick Smallbone
latest: '2.1'
description-type: haddock
description: ! '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.'
license-name: BSD3

Update from Hackage at 2018-02-07T23:26:01Z
Update from Hackage at 2018-02-07T23:26:01Z
