The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_NIA logic in the Incremental Track.
Page generated on 2023-07-06 16:05:24 +0000
Benchmarks: 12 Time Limit: 1200 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| SMTInterpol |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| 2021-MathSAT5n | 0 | 4181666 | 1726.19 | 1476.44 | 37547 | 2 | 0 |
| SMTInterpol | 0 | 4181657 | 3730.5 | 2810.41 | 37556 | 1 | 0 |
| cvc5 | 0 | 1739311 | 11578.32 | 11447.52 | 2479902 | 11 | 0 |
| Yices2 Fixedn | 0 | 192904 | 8992.26 | 8983.38 | 4026309 | 12 | 0 |
| Yices2 | 0 | 192466 | 8996.08 | 8986.93 | 4026747 | 12 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.