SMT-LIB2
E824099
SMT-LIB2 is a standardized input language and benchmark format for Satisfiability Modulo Theories (SMT) solvers, enabling consistent specification and exchange of logical problems across different tools.
All labels observed (9)
| Label | Occurrences |
|---|---|
| SMT-LIB initiative | 2 |
| SMT-LIB v2 | 2 |
| SMT-LIB2 canonical | 2 |
| SMT-LIB 2 | 1 |
| SMT-LIB 2.0 | 1 |
| SMT-LIB community | 1 |
| SMT-LIB language | 1 |
| SMT-LIB theories | 1 |
| SMT-LIB version 2 | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T9839093 — 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: SMT-LIB2 Context triple: [Z3, supportsInputFormat, SMT-LIB2]
-
A.
Satisfiability Modulo Theories (SMT)
Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
-
B.
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.
-
C.
Z3: An Efficient SMT Solver
Z3: An Efficient SMT Solver is a high-performance satisfiability modulo theories (SMT) solver widely used in program verification, formal methods, and automated reasoning.
-
D.
Boyer–Moore theorem prover
The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
-
E.
ACL2 theorem proving system
The ACL2 theorem proving system is an automated reasoning tool and programming language based on a subset of Common Lisp, widely used for modeling and mechanically verifying hardware, software, and mathematical theorems.
- 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: SMT-LIB2 Target entity description: SMT-LIB2 is a standardized input language and benchmark format for Satisfiability Modulo Theories (SMT) solvers, enabling consistent specification and exchange of logical problems across different tools.
-
A.
Satisfiability Modulo Theories (SMT)
Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
-
B.
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.
-
C.
Z3: An Efficient SMT Solver
Z3: An Efficient SMT Solver is a high-performance satisfiability modulo theories (SMT) solver widely used in program verification, formal methods, and automated reasoning.
-
D.
Boyer–Moore theorem prover
The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
-
E.
ACL2 theorem proving system
The ACL2 theorem proving system is an automated reasoning tool and programming language based on a subset of Common Lisp, widely used for modeling and mechanically verifying hardware, software, and mathematical theorems.
- F. None of above. chosen
Statements (51)
| Predicate | Object |
|---|---|
| instanceOf |
SMT-LIB family
ⓘ
benchmark format ⓘ input language ⓘ standard ⓘ |
| abbreviationOf | Satisfiability Modulo Theories Library version 2 ⓘ |
| application |
comparing SMT solvers
ⓘ
regression testing of SMT solvers ⓘ sharing SMT benchmarks ⓘ |
| associatedWith |
SMT-COMP competition
ⓘ
linked to:
SMT-COMP
|
| compatibleWith | multiple SMT solvers ⓘ |
| defines |
standard attributes
ⓘ
standard commands ⓘ standard logics ⓘ standard theories ⓘ |
| domain |
Satisfiability Modulo Theories
ⓘ
linked to:
Satisfiability Modulo Theories (SMT)
|
| fullName |
SMT-LIB version 2
ⓘ
linked to:
SMT-LIB2
|
| goal |
improve interoperability of SMT tools
ⓘ
provide a common standard for SMT input ⓘ |
| hasVersion |
SMT-LIB 2.0
ⓘ
SMT-LIB 2.1 ⓘ SMT-LIB 2.5 ⓘ |
| languageFamily | Lisp-like ⓘ |
| maintainedBy |
SMT-LIB community
ⓘ
linked to:
SMT-LIB2
|
| partOf |
SMT-LIB initiative
ⓘ
linked to:
SMT-LIB2
|
| predecessor | SMT-LIB version 1 ⓘ |
| purpose |
enable consistent specification of logical problems
ⓘ
enable exchange of SMT problems across different tools ⓘ provide a standardized benchmark format for SMT solvers ⓘ provide a standardized input language for SMT solvers ⓘ |
| supports |
annotations
ⓘ
assert commands ⓘ check-sat command ⓘ function declarations ⓘ get-model command ⓘ incremental solving ⓘ logic declarations ⓘ many-sorted first-order logic ⓘ push and pop commands ⓘ quantifiers ⓘ sort declarations ⓘ theory declarations ⓘ theory-specific constructs ⓘ uninterpreted functions ⓘ |
| syntaxStyle | S-expression ⓘ |
| usedBy |
SMT benchmarks
ⓘ
linked to:
SMT-COMP
SMT solvers ⓘ |
| usedIn |
automated reasoning research
ⓘ
constraint solving ⓘ formal verification ⓘ hardware verification ⓘ software verification ⓘ |
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: SMT-LIB2 Description of subject: SMT-LIB2 is a standardized input language and benchmark format for Satisfiability Modulo Theories (SMT) solvers, enabling consistent specification and exchange of logical problems across different tools.
Referenced by (12)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject linked to:
Z3 SMT solver
subject linked to:
Satisfiability Modulo Theories (SMT)
linked to: SMT-LIB2
subject linked to:
Satisfiability Modulo Theories (SMT)
linked to: SMT-LIB2
subject linked to:
Satisfiability Modulo Theories (SMT)
linked to: SMT-LIB2
linked to: SMT-LIB2
linked to: SMT-LIB2
linked to: SMT-LIB2
linked to: SMT-LIB2