The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFIDL logic in the Proof Exhibition Track.
Page generated on 2023-07-06 16:06:18 +0000
Benchmarks: 150 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 |
|---|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 98 | 5722.864 | 3671.027 | 52 | 52 | 0 |
| cvc5-lfsc | 0 | 80 | 13499.935 | 13495.164 | 70 | 70 | 0 |
| cvc5 | 0 | 6 | 374.557 | 371.463 | 144 | 144 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 98 | 5722.864 | 3671.027 | 52 | 52 | 0 |
| cvc5-lfsc | 0 | 80 | 13499.935 | 13495.164 | 70 | 70 | 0 |
| cvc5 | 0 | 6 | 374.557 | 371.463 | 144 | 144 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.