The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UF logic in the Proof Exhibition Track.
Page generated on 2022-08-10 11:19:33 +0000
Benchmarks: 2180 Time Limit: 1200 seconds Memory Limit: 60 GB
This track is experimental. Solvers are only ranked by performance, but no winner is selected.
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| OpenSMT | 0 | 2170 | 23006.43 | 22851.495 | 10 | 10 | 0 |
| veriT | 0 | 2133 | 64635.541 | 64309.113 | 47 | 38 | 5 |
| cvc5-lfsc | 0 | 2114 | 297953.939 | 297790.307 | 66 | 64 | 0 |
| smtinterpol | 0 | 2105 | 129127.437 | 111465.974 | 75 | 77 | 0 |
| cvc5 | 0 | 167 | 2359926.74 | 2359852.337 | 2013 | 1926 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| OpenSMT | 0 | 2170 | 23006.86 | 22851.265 | 10 | 10 | 0 |
| veriT | 0 | 2133 | 64642.661 | 64306.833 | 47 | 38 | 5 |
| cvc5-lfsc | 0 | 2114 | 297968.499 | 297788.267 | 66 | 64 | 0 |
| smtinterpol | 0 | 2105 | 131436.637 | 110990.895 | 75 | 75 | 0 |
| cvc5 | 0 | 167 | 2360251.74 | 2359755.937 | 2013 | 1926 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.