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 2022-08-10 11:18:22 +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 | 105239 | 1158150.985 | 1158262.15 | 246761 | 892 | 1 |
z3-4.8.17n | 0 | 104818 | 1147915.336 | 1148298.275 | 247182 | 885 | 1 |
cvc5 | 0 | 23122 | 985596.863 | 985388.285 | 328878 | 804 | 0 |
smtinterpol | 0 | 19136 | 2060143.157 | 2034591.154 | 332864 | 1598 | 0 |
UltimateEliminator+MathSAT | 0 | 0 | 8811.362 | 3907.314 | 352000 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.