1 <?xml version="1.0" encoding="UTF-8"?>
2 <!DOCTYPE pkgmetadata SYSTEM "https://www.gentoo.org/dtd/metadata.dtd">
5 <maintainer type="project">
6 <email>sci-mathematics@gentoo.org</email>
7 <name>Gentoo Mathematics Project</name>
10 E is a theorem prover for full first-order logic with equality. It accepts
11 a problem specification, typically consisting of a number of first-order
12 clauses or formulas, and a conjecture, again either in clausal or full
13 first-order form. The system will then try to find a formal proof for the
14 conjecture, assuming the axioms. If a proof is found, the system can
15 provide a detailed list of proof steps that can be individually verified.
16 If the conjecture is existential (i.e. it is of the form "there exists an X
17 with property P"), more recent versions can also provide possible answers
18 (values for X). Development of E started as part of the E-SETHEO project at
19 TUM. The first public release was in in 1998, and the system has been
20 continuously improved ever since. I believe that E now is one of the most
21 powerful and friendly reasoning systems for first-order logic. The prover
22 has successfully participated in many competitions.
25 <flag name="ho">enable support for higher-order logic</flag>
28 <bugs-to>https://github.com/eprover/eprover/issues/</bugs-to>
29 <remote-id type="github">eprover/eprover</remote-id>