eproverversion
E Theorem Prover
E is a theorem prover for first-order and higher-order logic with equality. It accepts a problem specification, typically consisting of a number of first-order clauses or formulas, and a conjecture, in clausal or full first-order/higher-order form. The system will then try to find a formal proof for the conjecture, assuming the axioms.
| Authors | Stephan Schulz, Simon Cruanes, Petar Vukmirovic, Mohamed Bassem and Martin Moehrmann |
|---|---|
| License | LGPL-2.1-or-later OR GPL-2.0-or-later |
| Published | |
| Homepage | https://www.eprover.org |
| Issue Tracker | Stephan Schulz (see homepage for email) |
| Maintainer | 7895506+MSoegtropIMC@users.noreply.github.com |
| Dependencies | |
| Source [http] | http://wwwlehre.dhbw-stuttgart.de/~sschulz/WORK/E_DOWNLOAD/V_3.1/E.tgz sha512=4258d9fbd8d32346f5c24dbf0475c98c8e325aa0dc75dacaacd0096357ced8dde4456b88b0d7094a42d317482b6fec46955a1574b0984098386703772f698459 |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/eprover/eprover.3.1/opam |
No package is dependent
