The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_NIA logic in the Incremental Track.
Results were generated on 2024-07-08
Benchmarks: 12
Time Limit: 1200 seconds
Memory Limit: 20480 GB
| Parallel Performance | SAT Performance (parallel) | UNSAT Performance (parallel) | 24 seconds Performance (parallel) |
|---|---|---|---|
| SMTInterpol | - | - | - |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 4.181657e+06 | 5473.975963 | 4669.796123 | 0 | 0 | 0 | 12 | 0 | 2 | 0 |
| cvc5 | 0 | 1.666939e+06 | 13997.319324 | 14058.100869 | 0 | 0 | 0 | 12 | 0 | 11 | 0 |
| Yices2 | 0 | 217487 | 14398.413646 | 14421.020973 | 0 | 0 | 0 | 12 | 0 | 12 | 0 |