The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_LRA division as of Thu Jul 12 23:54:00 GMT
Benchmarks in this division : 683
Time limit: 2400s
| Sequential Performance | Parallel Performance |
|---|---|
| SMTInterpol | SMTInterpol |
| Solver | Error Score | Reduction Score | avg. CPU time |
|---|---|---|---|
| SMTInterpol | 0.000 | 137208.382 | 182.836 |
| Yices 2.6.0 | 0.000 | 134790.705 | 145.594 |
| CVC4 | 0.000 | 0.000 | 0.047 |
| mathsat-5.5.2n | 0.000 | 114182.014 | 259.116 |
| z3-4.7.1n | 0.000 | 131105.546 | 150.800 |
| Solver | Error Score | Reduction Score | avg. CPU time | avg. WALL time |
|---|---|---|---|---|
| SMTInterpol | 0.000 | 137655.124 | 246.628 | 168.262 |
| Yices 2.6.0 | 0.000 | 134790.705 | 145.595 | 145.606 |
| CVC4 | 0.000 | 0.000 | 0.047 | 0.047 |
| mathsat-5.5.2n | 0.000 | 114182.014 | 259.117 | 259.113 |
| z3-4.7.1n | 0.000 | 131105.546 | 150.801 | 150.804 |
n. Non-competing.
1. Scores are computed according to Section 7 of the rules.