cvc5 vs HOL4
cvc5
cvc5.github.ioHOL4
hol-theorem-prover.orgSide by side
| Figure | cvc5 | HOL4 |
|---|---|---|
| Price from | Free | Free |
| Free plan | Yes | Yes |
| Free trial | — | — |
| Open source | — | — |
| Web | Yes | — |
| Windows | Yes | Yes |
| macOS | Yes | Yes |
| Linux | Yes | Yes |
| API | Yes | — |
| Self-hosted | Yes | Yes |
| Plans published | 1 | 1 |
| Spec score · Formal Verification Tools | 8.7 (#1) | 8.1 (#9) |
| Integrations | The project lists applications using cvc5, including Kind 2 and QMaxUSE as backend solvers, and TRLC through PyVCG for proving absence of runtime errors. | The maker documents editor support for Emacs and Vim. |
| Purpose | cvc5 is an efficient open-source automatic theorem prover for satisfiability modulo theories problems. | HOL4 is a proof assistant for higher-order logic and a programming environment for proving theorems and implementing proof tools. |
| Support | The project directs bug reports to its GitHub issue tracker and questions, feature requests, and contributions to GitHub Discussions. | The community offers help through a mailing list and Zulip chat, while bug reports and feature suggestions go to GitHub issues. |
Plans
In their own words
cvc5
cvc5 is a free, open-source solver for satisfiability modulo theories problems. It determines whether first-order formulas are satisfiable or valid across combinations of background theories, including arrays, bit-vectors, floating-point numbers, arithmetic, and strings. It also has a Syntax-Guided Synthesis engine for synthesizing functions against those theories.
The solver can run as a standalone command-line tool or be used as a library, with C++, C, Java, and Python APIs. Its binary accepts SMT-LIB v2 and SyGuS-IF input, and it can produce proofs and unsatisfiable cores to explain unsatisfiability results. The project links to an online interface for running SMT-LIB scripts and provides source releases and binaries for Linux, macOS, and Windows. cvc5 is led jointly by Stanford University and the University of Iowa. Research and commercial use are described as essentially unrestricted. The default license is modified BSD; using optional GPLv3 dependencies makes the combined work subject to GPLv3.
HOL4
HOL4 is a free, interactive proof assistant for higher-order logic, with a programming environment for proving theorems and building proof tools. It supports work that combines deduction, execution, and property checking. Built-in decision procedures and theorem provers can establish many simple theorems, and an oracle mechanism can connect to external programs such as SMT and BDD engines. HOL4 supports higher-order logic and Standard ML, and can produce proof artifacts and counterexamples. It is self-hosted and listed for Linux, macOS, and Windows. A Standard ML compiler is required, with Poly/ML recommended; Moscow ML and MLTon are also supported for building tool executables. Windows installation can use Cygwin or the Windows Linux subsystem with Poly/ML. Moscow ML is another option, but the Windows guide notes that it is slower, lacks some Poly/ML libraries, and cannot run concurrent Holmake builds. HOL includes Emacs modes for syntax display and session interaction, and the installation guide links to Vim plugin documentation. Online materials include a tutorial, quick reference, FAQ, manuals, and generated indexes.