The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the UFNRA logic in the Incremental Track.
Page generated on 2023-07-06 16:05:24 +0000
Benchmarks: 4 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 |
|---|---|---|---|---|---|---|---|
| 2022-z3-4.8.17n | 0 | 209 | 1.75 | 2.09 | 0 | 0 | 0 |
| cvc5 | 0 | 5 | 0.51 | 0.58 | 204 | 1 | 0 |
| SMTInterpol | 0 | 2 | 0.0 | 0.9 | 207 | 4 | 0 |
| UltimateEliminator+MathSAT | 0 | 0 | 0.0 | 0.0 | 209 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.