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 2022-08-10 11:18:22 +0000
Benchmarks: 10 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 | 4181657 | 1721.755 | 1473.873 | 0 | 0 | 0 |
| MathSATn | 0 | 4181657 | 1791.974 | 1544.846 | 0 | 0 | 0 |
| z3-4.8.17n | 0 | 4181657 | 2325.688 | 2105.819 | 0 | 0 | 0 |
| smtinterpol | 0 | 4181657 | 4117.536 | 3176.738 | 0 | 0 | 0 |
| cvc5 | 0 | 1680016 | 11561.726 | 11547.696 | 2501641 | 9 | 0 |
| Yices2 | 0 | 204951 | 12000.0 | 12000.0 | 3976706 | 10 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.