The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_AUFBVLIA logic in the Incremental Track.
Page generated on 2023-07-06 16:05:24 +0000
Benchmarks: 300 Time Limit: 1200 seconds Memory Limit: 60 GB
Parallel Performance |
---|
Yices2 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
Yices2 | 0 | 541 | 2603.49 | 2618.84 | 10 | 10 | 0 |
Yices2 Fixedn | 0 | 541 | 2616.5 | 2632.47 | 10 | 10 | 0 |
cvc5 | 0 | 489 | 21031.29 | 21047.95 | 62 | 62 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.