SMT-COMP
E904157
SMT-COMP is an annual competition that benchmarks and compares the performance of SMT (Satisfiability Modulo Theories) solvers on a standardized set of logical problems.
All labels observed (1)
| Label | Occurrences |
|---|---|
| SMT-COMP canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T11090185 — 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-COMP Context triple: [Satisfiability Modulo Theories, hasCompetition, SMT-COMP]
-
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: 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.
-
C.
SMT-LIB2
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.
-
D.
TNTSAT
TNTSAT is a French free-to-air satellite television platform that broadcasts the national digital terrestrial TV channels via satellite.
-
E.
CDCL SAT solver
A CDCL SAT solver is an advanced algorithm for solving Boolean satisfiability problems that extends the classic DPLL approach with conflict-driven clause learning and non-chronological backtracking to greatly improve efficiency on large, complex instances.
- 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-COMP Target entity description: SMT-COMP is an annual competition that benchmarks and compares the performance of SMT (Satisfiability Modulo Theories) solvers on a standardized set of logical problems.
-
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: 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.
-
C.
SMT-LIB2
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.
-
D.
TNTSAT
TNTSAT is a French free-to-air satellite television platform that broadcasts the national digital terrestrial TV channels via satellite.
-
E.
CDCL SAT solver
A CDCL SAT solver is an advanced algorithm for solving Boolean satisfiability problems that extends the classic DPLL approach with conflict-driven clause learning and non-chronological backtracking to greatly improve efficiency on large, complex instances.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
SMT solver competition
ⓘ
competition ⓘ |
| benchmarksAre | publicly available ⓘ |
| encourages |
reproducible experiments
ⓘ
standardized input formats ⓘ |
| evaluates | SMT solvers ⓘ |
| evaluatesAspect |
solver correctness
ⓘ
solver efficiency ⓘ solver performance ⓘ solver robustness ⓘ |
| focusesOn |
SMT solvers
ⓘ
Satisfiability Modulo Theories NERFINISHED ⓘ automated reasoning ⓘ decision procedures ⓘ |
| fullName | Satisfiability Modulo Theories Competition NERFINISHED ⓘ |
| hasFormat | competitive evaluation ⓘ |
| hasImpactOn |
academic research in SMT
ⓘ
design of SMT solvers ⓘ industrial use of SMT technology ⓘ |
| hasOutcome |
awards for best-performing solvers
ⓘ
rankings of SMT solvers ⓘ |
| hasPurpose |
benchmark SMT solvers
ⓘ
compare performance of SMT solvers ⓘ encourage development of SMT technology ⓘ provide standardized evaluation of SMT solvers ⓘ |
| includes |
application track
ⓘ
incremental track ⓘ model-validation track ⓘ multiple logic divisions ⓘ non-incremental track ⓘ unsat-core track ⓘ |
| inputFormat | SMT-LIB language NERFINISHED ⓘ |
| isAssociatedWith |
SMT community
ⓘ
SMT-LIB NERFINISHED ⓘ automated reasoning community ⓘ |
| isHeld | annually ⓘ |
| isRelatedTo |
CADE ATP System Competition
NERFINISHED
ⓘ
SAT Competition NERFINISHED ⓘ |
| isTypicallyAffiliatedWith | CAV conference ⓘ |
| language | English ⓘ |
| organisedBy |
SMT-COMP organizing committee
NERFINISHED
ⓘ
researchers in SMT ⓘ |
| resultsAre | publicly available ⓘ |
| startYear | 2005 ⓘ |
| uses |
SMT-LIB benchmark library
NERFINISHED
ⓘ
standardized set of logical problems ⓘ |
| website | https://smt-comp.github.io ⓘ |
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-COMP Description of subject: SMT-COMP is an annual competition that benchmarks and compares the performance of SMT (Satisfiability Modulo Theories) solvers on a standardized set of logical problems.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
Satisfiability Modulo Theories