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 2021-07-18 17:30:28 +0000
Benchmarks: 31 Time Limit: 1200 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| Yices2 incremental |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| 2020-Yices2 incrementaln | 0 | 950 | 10170.082 | 10170.035 | 17 | 6 | 0 |
| Yices2 incremental | 0 | 950 | 10271.445 | 10267.651 | 17 | 6 | 0 |
| MathSAT5n | 0 | 796 | 18770.333 | 18764.465 | 171 | 14 | 0 |
| cvc5-inc | 0 | 330 | 20108.05 | 20107.73 | 637 | 16 | 0 |
| 2020-Bitwuzla-fixedn | 0 | 123 | 154.44 | 151.707 | 844 | 0 | 0 |
| Bitwuzla | 0 | 123 | 212.805 | 211.936 | 844 | 0 | 0 |
| z3n | 0 | 23 | 23187.88 | 23187.544 | 944 | 19 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.