The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_LIA division as of Thu Jul 12 23:54:00 GMT
Benchmarks in this division : 3019
Time limit: 2400s
| Sequential Performance | Parallel Performance |
|---|---|
| SMTInterpol | SMTInterpol |
| Solver | Error Score | Reduction Score | avg. CPU time |
|---|---|---|---|
| SMTInterpol | 0.000 | 1486458.412 | 119.281 |
| Yices 2.6.0 | 0.000 | 1485793.891 | 180.938 |
| CVC4 | 0.000 | 0.000 | 0.107 |
| mathsat-5.5.2n | 0.000 | 1480678.261 | 279.416 |
| z3-4.7.1n | 0.000 | 1453064.304 | 265.185 |
| Solver | Error Score | Reduction Score | avg. CPU time | avg. WALL time |
|---|---|---|---|---|
| SMTInterpol | 0.000 | 1486458.412 | 156.355 | 112.551 |
| Yices 2.6.0 | 0.000 | 1485793.891 | 180.939 | 180.944 |
| CVC4 | 0.000 | 0.000 | 0.107 | 0.107 |
| mathsat-5.5.2n | 0.000 | 1480678.261 | 279.417 | 279.420 |
| z3-4.7.1n | 0.000 | 1453064.304 | 265.186 | 265.201 |
n. Non-competing.
1. Scores are computed according to Section 7 of the rules.