The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the UF logic in the Incremental Track.
Page generated on 2023-07-06 16:05:24 +0000
Benchmarks: 2033 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 |
---|---|---|---|---|---|---|---|
2020-z3n | 0 | 107078 | 536819.18 | 537015.77 | 252499 | 919 | 0 |
cvc5 | 0 | 26881 | 39903.87 | 40050.99 | 332696 | 932 | 0 |
SMTInterpol | 0 | 18342 | 138811.76 | 78847.43 | 341235 | 1621 | 0 |
UltimateEliminator+MathSAT | 0 | 0 | 0.0 | 0.0 | 359577 | 0 | 0 |
Yices2 | 0 | 0 | 0.0 | 0.0 | 359577 | 0 | 0 |
Yices2 Fixedn | 0 | 0 | 0.0 | 0.0 | 359577 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.