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 7 07:24:34 GMT
Benchmarks in this division: 37
Time Limit: 1200s
| Sequential Performance | Parallel Performance |
|---|---|
| CVC4 | CVC4 |
| Solver | Error Score | Correct Score | avg. CPU time |
|---|---|---|---|
| Boolector | 0.000 | 37.000 | 0.393 |
| CVC4 | 0.000 | 37.000 | 0.224 |
| MathSat5n | 0.000 | 37.000 | 0.104 |
| Yices2 | 0.000 | 37.000 | 0.322 |
| z3n | 0.000 | 34.000 | 195.843 |
| Solver | Error Score | Correct Score | avg. CPU time | avg. WALL time | Unsolved |
|---|---|---|---|---|---|
| Boolector | 0.000 | 37.000 | 0.393 | 0.395 | 0 |
| CVC4 | 0.000 | 37.000 | 0.224 | 0.224 | 0 |
| MathSat5n | 0.000 | 37.000 | 0.104 | 0.103 | 0 |
| Yices2 | 0.000 | 37.000 | 0.322 | 0.324 | 0 |
| z3n | 0.000 | 34.000 | 195.893 | 195.843 | 3 |
n. Non-competitive.
1. Scores are computed according to Section 7 of the rules.