The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_Equality+LinearArith division in the Incremental Track.
Page generated on 2023-07-06 16:05:24 +0000
Benchmarks: 2031 Time Limit: 1200 seconds Memory Limit: 60 GB
Logics:Parallel Performance |
---|
SMTInterpol |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
---|---|---|---|---|---|---|---|---|
2020-z3n | 0 | 5688167 | 101871.58 | 101388.16 | 45781 | 0 | 67 | 0 |
SMTInterpol | 0 | 4883289 | 200740.25 | 161523.59 | 850659 | 0 | 122 | 0 |
cvc5 | 0 | 4611536 | 157732.25 | 157085.88 | 1122412 | 0 | 108 | 0 |
Yices2 Fixedn | 0 | 4074462 | 89049.76 | 88598.07 | 1659486 | 0 | 77 | 0 |
Yices2 | 0 | 4074452 | 89670.48 | 89212.44 | 1659496 | 0 | 77 | 0 |
OpenSMT | 0 | 358984 | 212709.23 | 212496.14 | 5374964 | 0 | 178 | 0 |
n Non-competing.
Abstained: Total of benchmarks in logics in this division that solver chose to abstain from. For SAT/UNSAT scores, this column also includes benchmarks not known to be SAT/UNSAT.