The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_BVFPLRA logic in the Unsat Core Track.
Page generated on 2021-07-18 17:31:25 +0000
Benchmarks: 46 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 | 322 | 4811.852 | 4812.816 | 2 | 0 |
| cvc5-uc | 0 | 318 | 7001.954 | 7002.875 | 2 | 0 |
| MathSAT5n | 0 | 0 | 0.85 | 0.852 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| Bitwuzla | 0 | 322 | 4812.282 | 4812.756 | 2 | 0 |
| cvc5-uc | 0 | 318 | 7002.204 | 7002.765 | 2 | 0 |
| MathSAT5n | 0 | 0 | 0.85 | 0.852 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.