The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the ABVFPLRA logic in the Incremental Track.
Page generated on 2023-07-06 16:05:23 +0000
Benchmarks: 4 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 | 2269 | 228.67 | 229.03 | 0 | 0 | 0 |
cvc5 | 0 | 818 | 9.38 | 9.91 | 1451 | 1 | 0 |
2022-UltimateEliminator+MathSATn | 0 | 818 | 105.55 | 80.53 | 1451 | 0 | 0 |
UltimateEliminator+MathSAT | 0 | 279 | 32.45 | 15.55 | 1990 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.