The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_FP logic in the Proof Exhibition Track.
Page generated on 2022-08-10 11:19:33 +0000
Benchmarks: 10091 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 | 10015 | 90567.271 | 90582.243 | 76 | 75 | 0 |
cvc5 | 0 | 10013 | 94063.526 | 94077.731 | 78 | 78 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 10015 | 90586.411 | 90578.183 | 76 | 75 | 0 |
cvc5 | 0 | 10013 | 94083.276 | 94073.781 | 78 | 78 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.