The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_Equality+NonLinearArith division in the Incremental Track.
Page generated on 2022-08-10 11:18:21 +0000
Benchmarks: 512 Time Limit: 1200 seconds Memory Limit: 60 GB
Logics:| Parallel Performance |
|---|
| smtinterpol |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|
| z3-4.8.17n | 0 | 64995 | 101.241 | 94.702 | 1 | 0 | 0 | 0 |
| 2021-z3n | 0 | 64995 | 140.074 | 133.536 | 1 | 0 | 0 | 0 |
| smtinterpol | 0 | 63197 | 1876.814 | 736.822 | 1799 | 0 | 0 | 0 |
| cvc5 | 0 | 56701 | 4345.914 | 4308.375 | 8295 | 0 | 1 | 0 |
| MathSATn | 0 | 12101 | 20.734 | 28.229 | 52895 | 0 | 0 | 0 |
| Yices2 | 0 | 0 | 1.879 | 6.882 | 13266 | 0 | 0 | 0 |
n Non-competing.
Abstained: Total of benchmarks in logics in this division that solver chose to abstain from. For SAT/UNSAT scores, this column also includes benchmarks not known to be SAT/UNSAT.