The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFLRA logic in the Incremental Track.
Page generated on 2021-07-18 17:30:28 +0000
Benchmarks: 1529 Time Limit: 1200 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| Yices2 incremental |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| 2020-z3n | 0 | 13104 | 14102.42 | 13802.696 | 1 | 0 | 0 |
| Yices2 incremental | 0 | 13090 | 13469.464 | 13134.742 | 15 | 2 | 0 |
| cvc5-inc | 0 | 13046 | 48630.513 | 47934.049 | 59 | 14 | 0 |
| MathSAT5n | 0 | 12934 | 16253.676 | 15942.374 | 171 | 5 | 0 |
| SMTInterpol | 0 | 12600 | 62854.69 | 50406.88 | 505 | 24 | 0 |
| z3n | 0 | 12414 | 136477.111 | 136331.283 | 691 | 83 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.