The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_AUFBVNIA logic in the Incremental Track.
Page generated on 2023-07-06 16:05:24 +0000
Benchmarks: 44 Time Limit: 1200 seconds Memory Limit: 60 GB
Parallel Performance |
---|
cvc5 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
Yices2 Fixedn | 0 | 69 | 2713.46 | 2714.41 | 7 | 7 | 0 |
cvc5 | 0 | 65 | 3753.22 | 3754.65 | 11 | 11 | 0 |
Yices2 | 1 | 69 | 3258.84 | 3259.63 | 7 | 6 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.