The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_ANIA logic in the Unsat Core Track.
Page generated on 2022-08-10 11:18:51 +0000
Benchmarks: 27 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 |
---|---|---|---|---|---|---|
2021-cvc5-ucn | 0 | 58971 | 18383.751 | 18388.438 | 13 | 0 |
smtinterpol | 0 | 48802 | 12812.157 | 12602.064 | 10 | 0 |
MathSATn | 0 | 44048 | 21637.546 | 21640.554 | 17 | 0 |
z3-4.8.17n | 0 | 16405 | 14860.714 | 14864.11 | 11 | 0 |
cvc5 | 0 | 15302 | 18078.621 | 18082.564 | 14 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
2021-cvc5-ucn | 0 | 58971 | 18387.351 | 18387.938 | 13 | 0 |
smtinterpol | 0 | 48802 | 12812.157 | 12602.064 | 10 | 0 |
MathSATn | 0 | 44048 | 21639.776 | 21639.974 | 17 | 0 |
z3-4.8.17n | 0 | 16405 | 14863.114 | 14863.65 | 11 | 0 |
cvc5 | 0 | 15302 | 18081.401 | 18081.734 | 14 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.