The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFBV division in the Incremental Track.
Page generated on 2020-07-04 11:47:56 +0000
Benchmarks: 932 Time Limit: 1200 seconds Memory Limit: 60 GB
Parallel Performance |
---|
Bitwuzla |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
---|---|---|---|---|---|---|---|---|
Bitwuzla-fixedn | 0 | 2239 | 1848.876 | 1831.508 | 0 | 0 | 0 | |
Bitwuzla | 0 | 2239 | 1926.524 | 1905.507 | 0 | 0 | 0 | |
2018-Boolector (incremental)n | 0 | 2238 | 3716.924 | 3699.418 | 1 | 1 | 0 | |
Yices2 incremental | 0 | 2235 | 2934.641 | 2913.271 | 4 | 2 | 0 | |
Yices2-fixed incrementaln | 0 | 2235 | 2941.809 | 2915.252 | 4 | 2 | 0 | |
z3n | 0 | 2197 | 11567.048 | 11510.634 | 42 | 4 | 0 | |
MathSAT5n | 0 | 2174 | 5524.59 | 5446.175 | 65 | 4 | 0 | |
CVC4-inc | 0 | 2140 | 9738.059 | 9677.991 | 99 | 5 | 0 |
n Non-competing.
Abstained: Total of benchmarks in logics in this division that solver chose to abstain from. For SAT/UNSAT scores, this column also includes benchmarks not known to be SAT/UNSAT.