The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UF logic in the Incremental Track.
Page generated on 2021-07-18 17:30:28 +0000
Benchmarks: 889 Time Limit: 1200 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| cvc5-inc |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| z3n | 0 | 14209 | 270.456 | 249.505 | 0 | 0 | 0 |
| cvc5-inc | 0 | 14209 | 771.867 | 716.1 | 0 | 0 | 0 |
| SMTInterpol | 0 | 14209 | 3593.442 | 1307.271 | 0 | 0 | 0 |
| 2019-Yices 2.6.2 Incrementaln | 0 | 810 | 97.214 | 83.107 | 13399 | 0 | 0 |
| Yices2 incremental | 0 | 810 | 104.194 | 89.891 | 13399 | 0 | 0 |
| OpenSMT | 0 | 809 | 2871.009 | 2837.361 | 13400 | 1 | 0 |
| MathSAT5n | 0 | 762 | 184.494 | 169.733 | 13447 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.