The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_AUFBV logic in the Incremental Track.
Page generated on 2022-08-10 11:18:21 +0000
Benchmarks: 31 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-Yices2 incrementaln | 0 | 946 | 10066.221 | 10066.053 | 21 | 6 | 0 |
| Yices2 | 0 | 946 | 10140.77 | 10137.18 | 21 | 6 | 0 |
| z3-4.8.17n | 0 | 865 | 16833.118 | 16833.359 | 102 | 12 | 0 |
| MathSATn | 0 | 796 | 18539.224 | 18539.313 | 171 | 14 | 0 |
| cvc5 | 0 | 325 | 19779.405 | 19779.092 | 642 | 16 | 0 |
| Bitwuzla | 0 | 123 | 133.757 | 133.845 | 844 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.