The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the BVFPLRA logic in the Incremental Track.
Page generated on 2023-07-06 16:05:24 +0000
Benchmarks: 9 Time Limit: 1200 seconds Memory Limit: 60 GB
Parallel Performance |
---|
Bitwuzla |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
Bitwuzla | 0 | 4797 | 515.31 | 516.02 | 800 | 2 | 0 |
2022-Bitwuzlan | 0 | 3144 | 102.79 | 103.56 | 2453 | 6 | 0 |
cvc5 | 0 | 2964 | 50.29 | 51.28 | 2633 | 6 | 0 |
UltimateEliminator+MathSAT | 0 | 2157 | 192.12 | 132.26 | 3440 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.