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 2022-08-10 11:18:22 +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 |
|---|---|---|---|---|---|---|---|
| z3-4.8.17n | 0 | 8154 | 12862.107 | 12518.24 | 1 | 0 | 0 |
| 2020-z3n | 0 | 8154 | 13590.375 | 13268.099 | 1 | 0 | 0 |
| MathSATn | 0 | 8147 | 15540.396 | 15175.923 | 8 | 4 | 0 |
| Yices2 | 0 | 8133 | 17179.164 | 16861.285 | 22 | 6 | 0 |
| cvc5 | 0 | 8114 | 69450.724 | 68960.54 | 41 | 22 | 0 |
| OpenSMT | 0 | 8069 | 86148.415 | 85876.983 | 86 | 46 | 0 |
| smtinterpol | 0 | 7987 | 75714.773 | 63272.907 | 168 | 33 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.