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 2022-08-10 11:18:22 +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 |
---|---|---|---|---|---|---|---|
z3-4.8.17n | 0 | 209 | 2.203 | 2.192 | 0 | 0 | 0 |
2020-z3n | 0 | 209 | 2.866 | 2.856 | 0 | 0 | 0 |
cvc5 | 0 | 5 | 0.662 | 0.643 | 204 | 0 | 0 |
smtinterpol | 0 | 2 | 4800.0 | 4800.0 | 207 | 4 | 0 |
UltimateEliminator+MathSAT | 0 | 0 | 16.67 | 7.417 | 209 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.