4951d2230a
"E is a theorem prover for full first-order logic with equality. It accepts a problem specification, typically consisting of a number of first-order clauses or formulas, and a conjecture, again either in clausal or full first-order form. The system will then try to find a formal proof for the conjecture, assuming the axioms." [http://www4.informatik.tu-muenchen.de/~schulz/E/E.html] Signed-off-by: Adam Vandenberg <flangy@gmail.com>
17 lines
397 B
Ruby
17 lines
397 B
Ruby
require 'formula'
|
|
|
|
class Eprover < Formula
|
|
homepage 'http://www4.informatik.tu-muenchen.de/~schulz/E/E.html'
|
|
url 'http://www4.in.tum.de/~schulz/WORK/E_DOWNLOAD/V_1.4/E.tgz'
|
|
version '1.4'
|
|
md5 '4da7b0c06dddd96ce8ffeb77462d7f77'
|
|
|
|
def install
|
|
system "./configure", "--bindir=#{bin}", "--man-prefix=#{man}"
|
|
system "make install"
|
|
end
|
|
|
|
def test
|
|
system "#{bin}/eproof"
|
|
end
|
|
end
|