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 2022-08-10 11:18:21 +0000
Benchmarks: 4 Time Limit: 1200 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| UltimateEliminator+MathSAT |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| UltimateEliminator+MathSAT | 0 | 818 | 106.37 | 81.544 | 1451 | 0 | 0 |
| cvc5 | 0 | 818 | 1208.789 | 1208.724 | 1451 | 1 | 0 |
| Bitwuzla | 0 | 55 | 2.443 | 2.593 | 2214 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.