The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_ABVFP logic in the Unsat Core Track.
Page generated on 2022-08-10 11:18:51 +0000
Benchmarks: 1971 Time Limit: 1200 seconds Memory Limit: 60 GB
Sequential Performance | Parallel Performance |
---|---|
Bitwuzla | Bitwuzla |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
Bitwuzla | 0 | 16561 | 2781.146 | 2780.952 | 1 | 0 |
2021-Bitwuzlan | 0 | 16441 | 3025.379 | 3023.685 | 1 | 0 |
z3-4.8.17n | 0 | 16046 | 75088.72 | 74976.513 | 32 | 0 |
cvc5 | 0 | 14095 | 326024.992 | 326033.116 | 231 | 0 |
MathSATn | 0 | 624 | 200.989 | 199.472 | 0 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
Bitwuzla | 0 | 16561 | 2781.246 | 2780.852 | 1 | 0 |
2021-Bitwuzlan | 0 | 16441 | 3025.479 | 3023.585 | 1 | 0 |
z3-4.8.17n | 0 | 16046 | 75098.75 | 74975.243 | 32 | 0 |
cvc5 | 0 | 14095 | 326056.852 | 326024.666 | 231 | 0 |
MathSATn | 0 | 624 | 200.989 | 199.472 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.