The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_AUFBV division as of Thu Jul 12 23:54:00 GMT
Benchmarks in this division : 25
Time limit: 2400s
| Sequential Performance | Parallel Performance |
|---|---|
| Yices 2.6.0 | Yices 2.6.0 |
| Solver | Error Score | Reduction Score | avg. CPU time |
|---|---|---|---|
| Yices 2.6.0 | 0.000 | 15325.000 | 28.984 |
| CVC4 | 0.000 | 15309.000 | 3.007 |
| mathsat-5.5.2n | 0.000 | 15326.000 | 0.686 |
| z3-4.7.1n | 0.000 | 15264.000 | 4.538 |
| Solver | Error Score | Reduction Score | avg. CPU time | avg. WALL time |
|---|---|---|---|---|
| Yices 2.6.0 | 0.000 | 15325.000 | 28.984 | 28.987 |
| CVC4 | 0.000 | 15309.000 | 3.007 | 3.007 |
| mathsat-5.5.2n | 0.000 | 15326.000 | 0.686 | 0.687 |
| z3-4.7.1n | 0.000 | 15264.000 | 4.538 | 4.539 |
n. Non-competing.
1. Scores are computed according to Section 7 of the rules.