Package E

Equational Theorem Prover

http://www.eprover.org/

E is a purely equational theorem prover for full first-order logic.
That means it is a program that you can stuff a mathematical
specification (in first-order format) and a hypothesis into, and which
will then run forever, using up all of your machines' resources. Very
occasionally it will find a proof for the hypothesis and tell you so.

E's inference core is based on a modified version of the superposition
calculus for equational clausal logic. Both clausification and
reasoning on the clausal form can be documented in checkable proof
objects.

E was the best-performing open source software prover in the 2008 CADE
ATP System Competition (CASC) in the FOF, CNF, and UEQ divisions. In
the 2011 competition, it won second place in the FOF division, and
placed highly in CNF and UEQ.

General Commands
Command Description
checkproof manual page for checkproof 1.9.1-001
e_axfilter manual page for e_axfilter 1.9.1-001 Sungma
eground manual page for eground 1.9.1-001
ekb_create manual page for ekb_create 1.9.1-001
ekb_delete manual page for ekb_delete 0.1dev
ekb_ginsert manual page for ekb_ginsert 1.9.1-001
ekb_insert manual page for ekb_insert 1.9.1-001
e_ltb_runner manual page for e_ltb_runner 1.9.1-001 Sungma
epclextract manual page for epclextract 1.9.1-001
eproof manual page for eproof eproof
eproof_ram manual page for eproof_ram PROVER/eproof_ram
eprover manual page for E 1.9.1-001 Sungma