The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFNRA logic in the Incremental Track.
Page generated on 2022-08-10 11:18:22 +0000
Benchmarks: 1 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 |
---|---|---|---|---|---|---|---|
2021-z3n | 0 | 6 | 0.033 | 0.031 | 0 | 0 | 0 |
z3-4.8.17n | 0 | 6 | 0.033 | 0.032 | 0 | 0 | 0 |
cvc5 | 0 | 6 | 0.054 | 0.052 | 0 | 0 | 0 |
smtinterpol | 0 | 6 | 0.697 | 0.427 | 0 | 0 | 0 |
MathSATn | 0 | 0 | 0.005 | 0.02 | 6 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.