The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFLIA logic in the Model Validation Track.
Page generated on 2023-07-06 16:06:00 +0000
Benchmarks: 330 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 | 330 | 7136.322 | 5474.38 | 0 | 0 |
2022-smtinterpoln | 0 | 329 | 6103.116 | 4475.36 | 1 | 0 |
Yices2 | 0 | 320 | 2884.517 | 2886.388 | 10 | 0 |
cvc5 | 0 | 319 | 2125.748 | 2126.018 | 11 | 0 |
OpenSMT | 0 | 316 | 2808.713 | 2802.96 | 14 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
SMTInterpol | 0 | 330 | 7136.322 | 5474.38 | 0 | 0 |
2022-smtinterpoln | 0 | 330 | 7319.056 | 5618.28 | 0 | 0 |
Yices2 | 0 | 320 | 2884.517 | 2886.388 | 10 | 0 |
cvc5 | 0 | 319 | 2125.748 | 2126.018 | 11 | 0 |
OpenSMT | 0 | 316 | 2808.713 | 2802.96 | 14 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.