Theorem Prover on Formal Methods Tools

Bitwuzla

Sat, 07 Jun 2025 00:00:00 +0000

Bitwuzla is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, floating-point arithmetic, arrays, uninterpreted functions and their combinations.

Boolector

Sat, 07 Jun 2025 00:00:00 +0000

Not Maintained Since 2024

Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions. Succeeded by Bitwuzla

cvc4

Sat, 07 Jun 2025 00:00:00 +0000

Not Maintained Since 2021

cvc4 is an automatic theorem prover for SMT problems. It is succeeded by cvc5

cvc5

Sat, 07 Jun 2025 00:00:00 +0000

cvc5 is an automatic theorem prover for SMT problems.

E

Sat, 07 Jun 2025 00:00:00 +0000

E is a theorem prover for full first-order logic (and now monomorphic higher-order logic) with equality.

STP

Sat, 07 Jun 2025 00:00:00 +0000

STP is a constraint solver for quantifier-free bitvectors.

APIs and Bindings

This tool is available through the following interfaces:

C API: stp C API Reference
Python bindings: stp PyPI package

Vampire

Sat, 07 Jun 2025 00:00:00 +0000

Vampire is a theorem prover.

Z3

Sat, 07 Jun 2025 00:00:00 +0000

Z3 is a general-purpose theorem prover widely used for SAT & SMT solving.

APIs and Bindings

This tool is available through the following interfaces:

C API: Z3 C API Reference
C++ API: Z3 C++ Namespace Reference
.NET API: Z3 .NET Namespace Reference
Java API: Z3 Java API Reference
Python bindings: z3-solver PyPI package (Documentation)
Rust bindings: z3 crate on crates.io

Zipperposition

Sat, 07 Jun 2025 00:00:00 +0000

Zipperposition is an automated theorem prover for first-order logic with equality and theories.