CVC5
E905300
CVC5 is an open-source, state-of-the-art Satisfiability Modulo Theories (SMT) solver used for automated reasoning and formal verification tasks.
All labels observed (1)
| Label | Occurrences |
|---|---|
| CVC5 canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T11090188 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: CVC5 Context triple: [Satisfiability Modulo Theories, hasSolver, CVC5]
-
A.
CVC4
CVC4 is an open-source automated theorem prover and SMT (Satisfiability Modulo Theories) solver used for verifying logical formulas across a variety of theories such as arithmetic, bit-vectors, arrays, and datatypes.
-
B.
Yices
Yices is a high-performance Satisfiability Modulo Theories (SMT) solver widely used in formal verification and automated reasoning.
-
C.
Boolector
Boolector is an efficient SMT solver specialized in bit-vectors, arrays, and uninterpreted functions, widely used in formal verification and model checking.
-
D.
Z3 SMT solver
Z3 SMT solver is a high-performance Satisfiability Modulo Theories (SMT) solver developed at Microsoft Research, widely used in program verification, formal methods, and automated reasoning.
-
E.
SMTInterpol
SMTInterpol is an SMT solver focused on generating interpolants and solving satisfiability modulo theories problems, particularly over linear arithmetic and related theories.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: CVC5 Target entity description: CVC5 is an open-source, state-of-the-art Satisfiability Modulo Theories (SMT) solver used for automated reasoning and formal verification tasks.
-
A.
CVC4
CVC4 is an open-source automated theorem prover and SMT (Satisfiability Modulo Theories) solver used for verifying logical formulas across a variety of theories such as arithmetic, bit-vectors, arrays, and datatypes.
-
B.
Yices
Yices is a high-performance Satisfiability Modulo Theories (SMT) solver widely used in formal verification and automated reasoning.
-
C.
Boolector
Boolector is an efficient SMT solver specialized in bit-vectors, arrays, and uninterpreted functions, widely used in formal verification and model checking.
-
D.
Z3 SMT solver
Z3 SMT solver is a high-performance Satisfiability Modulo Theories (SMT) solver developed at Microsoft Research, widely used in program verification, formal methods, and automated reasoning.
-
E.
SMTInterpol
SMTInterpol is an SMT solver focused on generating interpolants and solving satisfiability modulo theories problems, particularly over linear arithmetic and related theories.
- F. None of above. chosen
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
SMT solver
ⓘ
automated reasoning tool ⓘ open-source software ⓘ software project ⓘ |
| acceptsInputFormat | SMT-LIB NERFINISHED ⓘ |
| hasDomain |
artificial intelligence
ⓘ
computer-aided verification ⓘ constraint solving ⓘ formal methods ⓘ software engineering ⓘ |
| hasFeature |
incremental solving
ⓘ
model generation ⓘ optimization capabilities ⓘ proof production ⓘ support for multiple logics in one input ⓘ unsat core extraction ⓘ |
| hasInterface |
API for integration into other tools
ⓘ
command-line interface ⓘ |
| hasProperty |
extensible
ⓘ
highly configurable ⓘ state-of-the-art ⓘ |
| implements | Satisfiability Modulo Theories NERFINISHED ⓘ |
| isA | Satisfiability Modulo Theories solver ⓘ |
| isPartOf | CVC family of SMT solvers ⓘ |
| isSuccessorOf | CVC4 NERFINISHED ⓘ |
| license | open-source license ⓘ |
| supportsLogic |
first-order logic fragments
ⓘ
quantified logics ⓘ quantifier-free logics ⓘ |
| supportsStandard | SMT-LIB language ⓘ |
| supportsTask |
automated reasoning
ⓘ
formal verification ⓘ model checking workflows ⓘ program analysis workflows ⓘ satisfiability checking ⓘ |
| supportsTheory |
arrays
ⓘ
bit-vectors ⓘ datatypes ⓘ floating-point arithmetic ⓘ linear arithmetic ⓘ nonlinear arithmetic ⓘ strings ⓘ uninterpreted functions ⓘ |
| usedFor |
constraint solving in research
ⓘ
formal methods education ⓘ hardware verification ⓘ safety-critical system analysis ⓘ software verification ⓘ |
| writtenIn | C++ NERFINISHED ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: CVC5 Description of subject: CVC5 is an open-source, state-of-the-art Satisfiability Modulo Theories (SMT) solver used for automated reasoning and formal verification tasks.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
Satisfiability Modulo Theories