The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the FP logic in the Proof Exhibition Track.
Page generated on 2022-08-10 11:19:33 +0000
Benchmarks: 1157 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 | 287 | 1044604.805 | 1044705.945 | 870 | 867 | 3 |
cvc5 | 0 | 262 | 1055392.391 | 1055443.243 | 895 | 873 | 3 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 287 | 1044695.225 | 1044683.025 | 870 | 867 | 3 |
cvc5 | 0 | 262 | 1055535.221 | 1055400.883 | 895 | 873 | 3 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.