The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_LRA logic in the Incremental Track.
Results were generated on 2024-07-08
Benchmarks: 10
Time Limit: 1200 seconds
Memory Limit: 20480 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 | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| OpenSMT | 0 | 1021 | 8511.084113 | 8515.740877 | 0 | 0 | 0 | 10 | 0 | 6 | 0 |
| Yices2 | 0 | 913 | 12009.504078 | 12017.296064 | 0 | 0 | 0 | 10 | 0 | 10 | 0 |
| cvc5 | 0 | 671 | 12009.680098 | 12017.239179 | 0 | 0 | 0 | 10 | 0 | 10 | 0 |
| SMTInterpol | 0 | 511 | 16611.623655 | 12024.744398 | 0 | 0 | 0 | 10 | 0 | 10 | 0 |