The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the AUFFPDTNIRA logic in the Unsat Core Track.
Page generated on 2022-08-10 11:18:51 +0000
Benchmarks: 132 Time Limit: 1200 seconds Memory Limit: 60 GB
Sequential Performance | Parallel Performance |
---|---|
cvc5 | cvc5 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
cvc5 | 0 | 4301 | 2414.452 | 2415.066 | 2 | 0 |
z3-4.8.17n | 0 | 4292 | 4900.773 | 4902.26 | 4 | 0 |
UltimateEliminator+MathSAT | 0 | 0 | 612.562 | 391.514 | 0 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
cvc5 | 0 | 4301 | 2414.942 | 2415.016 | 2 | 0 |
z3-4.8.17n | 0 | 4292 | 4901.853 | 4901.85 | 4 | 0 |
UltimateEliminator+MathSAT | 0 | 0 | 612.562 | 391.514 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.