The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UF division as of Thu Jul 7 07:28:02 GMT
Benchmarks in this division: 1
Time Limit: 1200s
| Solver | Solved | avg. CPU time | avg. WALL time |
|---|---|---|---|
| CVC4 | 0 | 600.36 | 600.03 |
| OpenSMT2 | 0 | 600.24 | 600.01 |
| Yices2 | 1 | 8.79 | 8.79 |
| MathSat5n | 0 | 600.41 | 600.10 |
| SMTInterpol | 0 | 610.61 | 600.04 |
| toysmt | 0 | 600.49 | 600.10 |
| veriT-dev | 1 | 64.12 | 64.08 |
| z3n | 0 | 600.37 | 600.07 |
n. Non-competitive.