E is a fully automatic theorem prover for full first-order logic with equality. it accepts a mathematical specification and, optionally, a hypothesis, and tries to prove the hypothesis and/or find a saturation representing a (counter-)model for the specification.

e is based on a purely equational problem representation and implements a variant of the superposition calculus. proof search can be guided with a multitude of options or a powerful automatic configuration mode. the system can process input in a number of different formats, including the standard tptp-2 and tptp-3 formats. it can generate proof objects in pcl2 or tptp-3/tstp format.

e is considered one of the most powerful and friendly automated theorem provers for first-order logic. it has consistently been among the top system in the major categories of the casc system competition, and usually been the strongest free software system.

this package contains e's documentation in html format.