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 2023-07-06 16:05:24 +0000
Benchmarks: 1 Time Limit: 1200 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| Yices2 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| Yices2 | 0 | 6 | 0.0 | 0.01 | 0 | 0 | 0 |
| Yices2 Fixedn | 0 | 6 | 0.0 | 0.01 | 0 | 0 | 0 |
| 2022-z3-4.8.17n | 0 | 6 | 0.0 | 0.02 | 0 | 0 | 0 |
| cvc5 | 0 | 6 | 0.0 | 0.03 | 0 | 0 | 0 |
| SMTInterpol | 0 | 6 | 0.0 | 0.41 | 0 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.