sci-mathematics/cvc4: Add cvc4 to the tree

Package-Manager: Portage-2.3.40, Repoman-2.3.9

diff --git a/sci-mathematics/cvc4/Manifest b/sci-mathematics/cvc4/Manifest
new file mode 100644 (file)
index 0000000..2b268f2
--- /dev/null
+++ b/sci-mathematics/cvc4/Manifest
@@ -0,0 +1 @@
+DIST cvc4-1.6.tar.gz 7815893 BLAKE2B 626e0dd49f911384e64d7e8ecf635aa12dad32830b2032bdcb96afd1a17c3566f56df51f75e9193cf365b562855733d0ea4ff3311ac99fc86e928a956298d2ad SHA512 0887b3f74a4b9e51e634591c7cf39d730110ca5d930149bab4816a49e383eeea8ccadf8474d22f5529cc03ddd045acacf8a2b92434b882adf352f4de4075fcd4

diff --git a/sci-mathematics/cvc4/cvc4-1.6.ebuild b/sci-mathematics/cvc4/cvc4-1.6.ebuild
new file mode 100644 (file)
index 0000000..1500f9d
--- /dev/null
+++ b/sci-mathematics/cvc4/cvc4-1.6.ebuild
@@ -0,0 +1,24 @@
+# Copyright 1999-2018 Gentoo Foundation
+# Distributed under the terms of the GNU General Public License v2
+
+EAPI=6
+
+DESCRIPTION="automatic theorem prover for satisfiability modulo theories (SMT) problems"
+HOMEPAGE="http://cvc4.cs.stanford.edu/web/"
+SRC_URI="http://cvc4.cs.stanford.edu/downloads/builds/src/${P}.tar.gz"
+
+LICENSE="GPL-2"
+SLOT="0"
+KEYWORDS="~amd64 ~x86"
+IUSE="+cln"
+
+RDEPEND="dev-libs/antlr-c
+       dev-libs/boost
+       cln? ( sci-libs/cln )
+       !cln? ( dev-libs/gmp:= )"
+DEPEND="${RDEPEND}"
+
+src_configure () {
+       econf --enable-gpl \
+               $(use_with cln)
+}

diff --git a/sci-mathematics/cvc4/metadata.xml b/sci-mathematics/cvc4/metadata.xml
new file mode 100644 (file)
index 0000000..d1a2996
--- /dev/null
+++ b/sci-mathematics/cvc4/metadata.xml
@@ -0,0 +1,17 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE pkgmetadata SYSTEM "http://www.gentoo.org/dtd/metadata.dtd">
+<pkgmetadata>
+       <maintainer type="person">
+               <email>tupone@gentoo.org</email>
+               <name>Tupone Alfredo</name>
+       </maintainer>
+       <use>
+               <flag name="cln">Use sci-libs/cln</flag>
+       </use>
+       <longdescription lang="en">
+               CVC4 is an efficient open-source automatic theorem prover for
+               satisfiability modulo theories (SMT) problems. It can be used to prove
+               the validity (or, dually, the satisfiability) of first-order formulas
+               in a large number of built-in logical theories and their combination.
+       </longdescription>
+</pkgmetadata>