The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_UFNIA logic in the Incremental Track.
Results were generated on 2024-07-08
Benchmarks: 506
Time Limit: 1200 seconds
Memory Limit: 20480 GB
| Parallel Performance | SAT Performance (parallel) | UNSAT Performance (parallel) | 24 seconds Performance (parallel) |
|---|---|---|---|
| cvc5 | - | - | SMTInterpol |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| cvc5 | 0 | 97885 | 18852.524342 | 18914.602507 | 0 | 0 | 0 | 506 | 0 | 7 | 0 |
| SMTInterpol | 0 | 96785 | 1871.871775 | 754.086334 | 0 | 0 | 0 | 506 | 0 | 0 | 0 |
| Yices2 | 0 | 35150 | 8262.824372 | 8319.706022 | 0 | 0 | 0 | 506 | 0 | 6 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 12212 | 1756.304154 | 689.945575 | 0 | 0 | 0 | 505 | 1 | 0 | 0 |
| Yices2 | 0 | 11605 | 575.976905 | 624.867938 | 0 | 0 | 0 | 490 | 16 | 0 | 0 |
| cvc5 | 0 | 8674 | 1057.10482 | 1102.033181 | 0 | 0 | 0 | 447 | 59 | 0 | 0 |