| Paketname | eprover-examples |
| Beschreibung | Theorem prover for first-order logic with equality - examples |
| Archiv/Repository | Offizielles Ubuntu Archiv lucid (universe) |
| Version | 1.0.004-1ubuntu1 |
| Sektion | universe/science |
| Priorität | extra |
| Installierte Größe | 964 Byte |
| Hängt ab von | eprover |
| Empfohlene Pakete | |
| Paketbetreuer | Ubuntu MOTU Developers |
| Quelle | eprover |
| Paketgröße | 191738 Byte |
| Prüfsumme MD5 | 7e4b79b4e226097fa9866b19fd63abdc |
| Prüfsumme SHA1 | c31dc7aa77992597033fd7697d34753bda3f1122 |
| Prüfsumme SHA256 | ca44df11477223440e02d668a41f78ca90cceab656d8dd72b86bd463eed74b0e |
| Link zum Herunterladen | eprover-examples_1.0.004-1ubuntu1_all.deb |
| Ausführliche Beschreibung | 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 several sample inputs to try E on.
|