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