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 Incremental Track.
Page generated on 2022-08-10 11:18:21 +0000
Benchmarks: 10 Time Limit: 1200 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| OpenSMT |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| 2018-MathSAT-incrementaln | 0 | 1256 | 8452.595 | 8452.553 | 259 | 5 | 0 |
| MathSATn | 0 | 970 | 10951.907 | 10951.698 | 545 | 9 | 0 |
| OpenSMT | 0 | 905 | 9214.976 | 9214.848 | 610 | 6 | 0 |
| Yices2 | 0 | 902 | 12000.0 | 12000.0 | 613 | 10 | 0 |
| cvc5 | 0 | 685 | 12000.0 | 12000.0 | 830 | 10 | 0 |
| z3-4.8.17n | 0 | 597 | 12000.0 | 12000.0 | 918 | 10 | 0 |
| smtinterpol | 0 | 493 | 12000.0 | 12000.0 | 1022 | 10 | 0 |
| solsmt | 0 | 60 | 12000.0 | 12000.0 | 1455 | 6 | 4 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.