The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_LIA logic in the Incremental Track.
Results were generated on 2024-07-08
Benchmarks: 69
Time Limit: 1200 seconds
Memory Limit: 20480 GB
| Parallel Performance | SAT Performance (parallel) | UNSAT Performance (parallel) | 24 seconds Performance (parallel) |
|---|---|---|---|
| Yices2 | - | - | Yices2 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| Yices2 | 0 | 2.0040419e+07 | 30476.606885 | 30305.986001 | 0 | 0 | 0 | 69 | 0 | 20 | 0 |
| SMTInterpol | 0 | 1.7927273e+07 | 83956.894657 | 56163.678151 | 0 | 0 | 0 | 69 | 0 | 36 | 0 |
| cvc5 | 0 | 3.491863e+06 | 66814.340494 | 66934.146986 | 0 | 0 | 0 | 69 | 0 | 53 | 0 |
| OpenSMT | 0 | 1.050457e+06 | 54158.466014 | 54225.639507 | 0 | 0 | 0 | 69 | 0 | 40 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| Yices2 | 0 | 874094 | 104.906201 | 96.756145 | 0 | 0 | 0 | 18 | 51 | 0 | 0 |
| OpenSMT | 0 | 1818 | 103.848554 | 105.169806 | 0 | 0 | 0 | 13 | 56 | 0 | 0 |
| cvc5 | 0 | 1111 | 88.897717 | 89.830438 | 0 | 0 | 0 | 9 | 60 | 0 | 0 |
| SMTInterpol | 0 | 606 | 109.788002 | 45.717965 | 0 | 0 | 0 | 4 | 65 | 0 | 0 |