The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_LRA logic in the Incremental Track. Chart
Results were generated on 2025-08-11
Benchmarks: 10
Time Limit: 1200 seconds
Memory Limit: 30720 GB
| Parallel Performance | SAT Performance (parallel) | UNSAT Performance (parallel) | 24 seconds Performance (parallel) |
|---|---|---|---|
| OpenSMT | - | - | - |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|
| OpenSMT | 0 | 972 | 7327.52 | 7327.52 | 0 | 10 | 0 | 6 | 0 |
| Yices2 | 0 | 957 | 10653.21 | 10653.21 | 0 | 10 | 0 | 10 | 0 |
| cvc5 | 0 | 688 | 9902.30 | 9902.30 | 0 | 10 | 0 | 10 | 0 |
| SMTInterpol | 0 | 485 | 9526.39 | 9526.39 | 0 | 10 | 0 | 9 | 0 |