The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the UFNIA logic in the Incremental Track.
Page generated on 2023-07-06 16:05:24 +0000
Benchmarks: 2031 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 | 84259 | 610167.22 | 610383.06 | 243319 | 988 | 0 |
cvc5 | 0 | 31127 | 61618.63 | 61780.45 | 296451 | 888 | 0 |
SMTInterpol | 0 | 14498 | 98746.3 | 68091.66 | 313080 | 1041 | 0 |
UltimateEliminator+MathSAT | 0 | 0 | 0.0 | 0.0 | 327578 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.