The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_FPLRA logic in the Model Validation Track.
Page generated on 2023-07-06 16:06:00 +0000
Benchmarks: 54 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 Fixedn | 0 | 54 | 644.856 | 645.136 | 0 | 0 |
| Bitwuzla | 0 | 54 | 649.913 | 645.162 | 0 | 0 |
| 2022-Bitwuzlan | 0 | 54 | 1042.736 | 1041.377 | 0 | 0 |
| cvc5 | 0 | 47 | 885.936 | 886.04 | 7 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| Bitwuzla Fixedn | 0 | 54 | 644.856 | 645.136 | 0 | 0 |
| Bitwuzla | 0 | 54 | 649.913 | 645.162 | 0 | 0 |
| 2022-Bitwuzlan | 0 | 54 | 1042.736 | 1041.377 | 0 | 0 |
| cvc5 | 0 | 47 | 885.936 | 886.04 | 7 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.