The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the ANIA logic in the Incremental Track.
Page generated on 2023-07-06 16:05:23 +0000
Benchmarks: 3 Time Limit: 1200 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| cvc5 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| cvc5 | 0 | 23488 | 58.15 | 55.83 | 0 | 0 | 0 |
| SMTInterpol | 0 | 23486 | 129.97 | 47.45 | 2 | 0 | 0 |
| UltimateEliminator+MathSAT | 0 | 9564 | 3666.08 | 3577.05 | 13924 | 3 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.