The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFDTLIRA logic in the Unsat Core Track.
Page generated on 2022-08-10 11:18:51 +0000
Benchmarks: 17 Time Limit: 1200 seconds Memory Limit: 60 GB
Sequential Performance | Parallel Performance |
---|---|
cvc5 | cvc5 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
cvc5 | 0 | 162 | 0.45 | 0.448 | 0 | 0 |
z3-4.8.17n | 0 | 162 | 0.492 | 0.465 | 0 | 0 |
smtinterpol | 0 | 162 | 10.944 | 7.159 | 0 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
cvc5 | 0 | 162 | 0.45 | 0.448 | 0 | 0 |
z3-4.8.17n | 0 | 162 | 0.492 | 0.465 | 0 | 0 |
smtinterpol | 0 | 162 | 10.944 | 7.159 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.