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 Unsat Core Track.
Page generated on 2023-07-06 16:05:43 +0000
Benchmarks: 100 Time Limit: 1200 seconds Memory Limit: 60 GB
Sequential Performance | Parallel Performance |
---|---|
SMTInterpol | SMTInterpol |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
2022-z3-4.8.17n | 0 | 679843 | 24795.87 | 24806.122 | 20 | 0 |
SMTInterpol | 0 | 111642 | 10917.759 | 7176.575 | 82 | 0 |
cvc5 | 0 | 101480 | 13520.541 | 13521.829 | 78 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
2022-z3-4.8.17n | 0 | 679843 | 24795.87 | 24806.122 | 20 | 0 |
SMTInterpol | 0 | 165534 | 25052.149 | 15455.377 | 73 | 0 |
cvc5 | 0 | 101480 | 13520.541 | 13521.829 | 78 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.