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 Incremental Track.
Page generated on 2022-08-10 11:18:21 +0000
Benchmarks: 5 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 |
---|---|---|---|---|---|---|---|
2021-z3n | 0 | 51724 | 56.227 | 52.384 | 0 | 0 | 0 |
z3-4.8.17n | 0 | 51724 | 56.576 | 52.636 | 0 | 0 | 0 |
smtinterpol | 0 | 51724 | 274.023 | 99.226 | 0 | 0 | 0 |
cvc5 | 0 | 43429 | 1454.966 | 1450.21 | 8295 | 1 | 0 |
MathSATn | 0 | 12101 | 17.937 | 17.249 | 39623 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.