The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_NIA logic in the Incremental Track.
Page generated on 2021-07-18 17:30:28 +0000
Benchmarks: 10 Time Limit: 1200 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| SMTInterpol |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| MathSAT5n | 0 | 4181657 | 1715.647 | 1472.603 | 0 | 0 | 0 |
| 2020-MathSAT5n | 0 | 4181657 | 1727.501 | 1483.185 | 0 | 0 | 0 |
| z3n | 0 | 4181657 | 2330.352 | 2115.35 | 0 | 0 | 0 |
| SMTInterpol | 0 | 4181657 | 3755.817 | 2828.911 | 0 | 0 | 0 |
| cvc5-inc | 0 | 3448410 | 7606.184 | 7368.307 | 733247 | 1 | 0 |
| Yices2 incremental | 0 | 193039 | 12000.0 | 12000.0 | 3988618 | 10 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.