The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFLIA division as of Thu Jul 12 23:54:00 GMT
Benchmarks in this division : 183
Time limit: 2400s
| Sequential Performance | Parallel Performance |
|---|---|
| SMTInterpol | SMTInterpol |
| Solver | Error Score | Reduction Score | avg. CPU time |
|---|---|---|---|
| SMTInterpol | 0.000 | 35.376 | 5.197 |
| Yices 2.6.0 | 0.000 | 35.376 | 9.837 |
| CVC4 | 0.000 | 30.322 | 3.705 |
| mathsat-5.5.2n | 0.000 | 35.376 | 30.100 |
| z3-4.7.1n | 0.000 | 35.376 | 0.767 |
| Solver | Error Score | Reduction Score | avg. CPU time | avg. WALL time |
|---|---|---|---|---|
| SMTInterpol | 0.000 | 35.376 | 5.197 | 3.636 |
| Yices 2.6.0 | 0.000 | 35.376 | 9.837 | 9.841 |
| CVC4 | 0.000 | 30.322 | 3.705 | 3.699 |
| mathsat-5.5.2n | 0.000 | 35.376 | 30.100 | 30.103 |
| z3-4.7.1n | 0.000 | 35.376 | 0.767 | 0.768 |
n. Non-competing.
1. Scores are computed according to Section 7 of the rules.