cvc5

cvc5 is an automatic theorem prover for developers and researchers working with formal verification and synthesis. It suits teams that need a solver they can run on its own or embed in software. Its broad theory support and APIs are compelling; the main caveat is the licensing effect of optional GPLv3 dependencies.

Overview

cvc5 checks whether first-order formulas are satisfiable or valid across combinations of background theories. It also offers Syntax-Guided Synthesis, which synthesizes functions subject to those theories. That makes it useful both for direct verification work and as a solver behind another tool. Kind 2, QMaxUSE, and TRLC use it as a backend or in verification checks.

Proofs and unsatisfiable cores can help explain unsatisfiability results. The project describes its core usage without experimental options as intended to be extremely robust, while prioritizing user bugs over fuzzer bugs. That is a sensible focus for production workflows, though it does not make experimental options equally dependable.

Key features

Theory support and interfaces

cvc5 supports standardized SMT-LIB theories for arrays, bit-vectors, floating-point numbers, integer and real arithmetic, mixed-integer arithmetic, and strings, along with nonstandard and extended theories. This range is valuable when a verification problem combines several domains, but users still need to express their problem in a supported formalism.

The command-line tool accepts SMT-LIB v2 and SyGuS-IF. Library bindings include C++, C, Java, and Python, with a Pythonic API documented as well. This gives software teams several ways to integrate the solver; readers looking for a graphical, interactive proof environment may find the command-line and library model a poor fit.

Synthesis and support

The SyGuS engine expands cvc5 beyond checking formulas by synthesizing functions under background-theory constraints. Bug reports go to the issue tracker, while questions, feature requests, and contributions are handled through GitHub Discussions. The project is a joint effort led by Stanford University and the University of Iowa.

Pricing

cvc5 is free: its open-source plan costs nothing and has no trial requirement. It can be used as a standalone tool or as a library, with essentially no limit on research or commercial use under the project's stated terms. The default license is modified BSD. If a build links optional GPLv3 dependencies, the resulting combined work is subject to GPLv3, a material consideration for commercial distribution.

Platforms

cvc5 supports Linux, macOS, Windows, API use, self-hosting, and web access. Source releases and binaries are provided for the desktop platforms, and the project recommends prebuilt binaries for new users. The homepage also links to an online interface for running SMT-LIB scripts, which offers a way to try the solver through a browser.

Who it's for

cvc5 is a strong fit for researchers, formal-methods practitioners, and developers who need SMT solving across several theories, synthesis support, or an embeddable solver with bindings in their preferred language. It is less suitable for people seeking a general-purpose interactive theorem prover or a guided visual workflow: its strengths center on formulas, scripts, and software integration.

Pros and cons

• Broad standardized theory coverage: handles common domains such as arrays, arithmetic, strings, and bit-vectors, including mixed-integer arithmetic.
• Standalone and library use: supports command-line workflows and integration through C++, C, Java, and Python APIs.
• Proof and synthesis capabilities: produces proofs and unsatisfiable cores, and can synthesize functions with SyGuS.
• License needs review for some builds: optional GPLv3 dependencies change the license obligations for the combined work.
• Specialized interaction model: its SMT-LIB and API focus may not suit users who want an interactive proof assistant.

Alternatives

Lean is another free option for readers comparing theorem-proving tools; choose it if its platform and project setup better match your workflow.

Rocq is a free interactive theorem prover and dependently typed programming language, making it the more relevant option when that style of proof development is the priority.

PVS offers a free noncommercial plan and custom pricing for commercial use, so it is worth considering when its platform support fits and the solver's commercial terms are acceptable.

Z3 is a free, MIT-licensed solver with API, self-hosted, web, and Android support; consider it when its licensing or platform options suit your deployment better.

Boogie is free, MIT licensed, and requires .NET and a supported SMT solver, so it fits readers already working in that toolchain.

HOL4 is free software under a Modified BSD license and supports self-hosted use, an alternative to consider when those terms and platforms fit.

Why3 is free under LGPL 2.1 with a special linking exception; consider it if that licensing arrangement or its supported platforms better fit your project.

Isabelle is a free option distributed under open-source licenses with a BSD-style main code base, suitable for readers comparing licensing and platform coverage.

Browse the Formal Verification Tools list for more options.

Verdict

Choose cvc5 if you need a free, embeddable SMT solver with wide theory coverage, synthesis, and language bindings. Its main advantage is the combination of standalone and library workflows; look elsewhere if you need an interactive proof environment, and check optional GPLv3 dependencies before distributing a combined work.