The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFLRA logic in the Incremental Track.
Page generated on 2023-07-06 16:05:24 +0000
Benchmarks: 1529 Time Limit: 1200 seconds Memory Limit: 60 GB
Parallel Performance |
---|
Yices2 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
2020-z3n | 0 | 8525 | 15160.34 | 14971.16 | 1 | 0 | 0 |
Yices2 Fixedn | 0 | 8509 | 15530.13 | 15325.45 | 17 | 4 | 0 |
Yices2 | 0 | 8509 | 15821.19 | 15608.04 | 17 | 4 | 0 |
cvc5 | 0 | 8489 | 36358.79 | 36019.83 | 37 | 17 | 0 |
OpenSMT | 0 | 8410 | 51285.59 | 51049.59 | 116 | 41 | 0 |
SMTInterpol | 0 | 8344 | 72544.61 | 52036.5 | 182 | 30 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.