The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the NIA logic in the Proof Exhibition Track.
Page generated on 2022-08-10 11:19:33 +0000
Benchmarks: 141 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 |
---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 123 | 22495.436 | 22504.222 | 18 | 18 | 0 |
cvc5 | 0 | 117 | 26545.614 | 26527.821 | 24 | 20 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 123 | 22502.716 | 22503.042 | 18 | 18 | 0 |
cvc5 | 0 | 117 | 26552.744 | 26526.601 | 24 | 20 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.