The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFBV division as of Thu Jul 7 07:24:34 GMT
Benchmarks in this division: 31
Time Limit: 1200s
| Sequential Performance | Parallel Performance |
|---|---|
| Boolector | Boolector |
| Solver | Error Score | Correct Score | avg. CPU time |
|---|---|---|---|
| Boolector | 0.000 | 31.000 | 49.531 |
| CVC4 | 0.000 | 31.000 | 523.070 |
| MathSat5n | 0.000 | 21.738 | 925.681 |
| Yices2 | 0.000 | 31.000 | 351.115 |
| z3n | 0.000 | 30.158 | 701.042 |
| Solver | Error Score | Correct Score | avg. CPU time | avg. WALL time | Unsolved |
|---|---|---|---|---|---|
| Boolector | 0.000 | 31.000 | 49.531 | 49.503 | 0 |
| CVC4 | 0.000 | 31.000 | 523.070 | 522.807 | 0 |
| MathSat5n | 0.000 | 21.738 | 926.077 | 925.582 | 11 |
| Yices2 | 0.000 | 31.000 | 351.115 | 350.921 | 0 |
| z3n | 0.000 | 30.158 | 701.078 | 700.698 | 1 |
n. Non-competitive.
1. Scores are computed according to Section 7 of the rules.