The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFDTLIA logic in the Proof Exhibition Track.
Page generated on 2023-07-06 16:06:18 +0000
Benchmarks: 11 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 | 10 | 2466.36 | 2068.629 | 1 | 1 | 0 |
| cvc5-lfsc | 0 | 6 | 1330.552 | 1328.904 | 5 | 5 | 0 |
| cvc5 | 0 | 0 | 0.0 | 0.0 | 11 | 11 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 10 | 2466.36 | 2068.629 | 1 | 1 | 0 |
| cvc5-lfsc | 0 | 6 | 1330.552 | 1328.904 | 5 | 5 | 0 |
| cvc5 | 0 | 0 | 0.0 | 0.0 | 11 | 11 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.