E is a a purely equational theorem prover for clausal logic.
That means it is a program that you can stuff a
mathematical specification (in clausal logic with equality)
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 ;-).