The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_LRA logic in the Unsat Core Track.
Page generated on 2023-07-06 16:05:43 +0000
Benchmarks: 208 Time Limit: 1200 seconds Memory Limit: 60 GB
Sequential Performance | Parallel Performance |
---|---|
Yices2 | Yices2 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
2020-Yices2n | 0 | 152335 | 24417.549 | 24362.1 | 44 | 0 |
Yices2 | 0 | 148829 | 22311.233 | 22309.462 | 47 | 0 |
cvc5 | 0 | 117667 | 27786.068 | 27790.615 | 18 | 0 |
SMTInterpol | 0 | 95268 | 45130.4 | 40680.772 | 55 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
2020-Yices2n | 0 | 152335 | 24417.549 | 24362.1 | 44 | 0 |
Yices2 | 0 | 148829 | 22311.233 | 22309.462 | 47 | 0 |
cvc5 | 0 | 117667 | 26586.238 | 26590.605 | 18 | 0 |
SMTInterpol | 0 | 95268 | 45130.4 | 40680.772 | 55 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.