@hackage / twee-lib

An equational theorem prover

Latest2.6.1

About

Metadata

  • Last updated , by NickSmallbone
  • License BSD-3-Clause

  • Maintained by: nicsma@chalmers.se

  • Lottery factor: 1

Links

Installation

Package Flags

Use the -f option with cabal commands to enable flags

    llvm (off by default)

    Build using LLVM backend for faster code.

    bounds-checks (off by default)

    Use bounds checks for all array operations.

    profile (off by default)

    Print a profiling report after every prover run.

Readme

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.

This package contains only the library part of twee.