The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFNIA logic in the Incremental Track.
Page generated on 2022-08-10 11:18:22 +0000
Benchmarks: 506 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 |
|---|---|---|---|---|---|---|---|
| cvc5 | 0 | 13266 | 2890.894 | 2858.113 | 0 | 0 | 0 |
| z3-4.8.17n | 0 | 13265 | 44.632 | 42.034 | 1 | 0 | 0 |
| 2021-z3n | 0 | 13265 | 83.815 | 81.121 | 1 | 0 | 0 |
| smtinterpol | 0 | 11467 | 1602.093 | 637.169 | 1799 | 0 | 0 |
| Yices2 | 0 | 0 | 1.879 | 6.882 | 13266 | 0 | 0 |
| MathSATn | 0 | 0 | 2.793 | 10.96 | 13266 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.