The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_AUFNIA logic in the Unsat Core Track.
Page generated on 2022-08-10 11:18:51 +0000
Benchmarks: 12 Time Limit: 1200 seconds Memory Limit: 60 GB
| Sequential Performance | Parallel Performance |
|---|---|
| smtinterpol | smtinterpol |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| smtinterpol | 0 | 20421 | 68.281 | 20.885 | 0 | 0 |
| z3-4.8.17n | 0 | 20257 | 1.497 | 1.476 | 0 | 0 |
| MathSATn | 0 | 20149 | 10.558 | 9.511 | 0 | 0 |
| 2021-cvc5-ucn | 0 | 20095 | 165.335 | 165.35 | 0 | 0 |
| cvc5 | 0 | 16434 | 151.674 | 151.696 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| smtinterpol | 0 | 20421 | 68.281 | 20.885 | 0 | 0 |
| z3-4.8.17n | 0 | 20257 | 1.497 | 1.476 | 0 | 0 |
| MathSATn | 0 | 20149 | 10.558 | 9.511 | 0 | 0 |
| 2021-cvc5-ucn | 0 | 20095 | 165.335 | 165.35 | 0 | 0 |
| cvc5 | 0 | 16434 | 151.674 | 151.696 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.