The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the AUFBV logic in the Proof Exhibition Track.
Page generated on 2022-08-10 11:19:33 +0000
Benchmarks: 321 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 | 42 | 154887.617 | 154923.813 | 279 | 117 | 2 |
cvc5 | 0 | 2 | 191877.01 | 191909.067 | 319 | 154 | 2 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 42 | 154919.367 | 154918.343 | 279 | 117 | 2 |
cvc5 | 0 | 2 | 191917.07 | 191901.087 | 319 | 154 | 2 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.