The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the UFNIA logic in the Proof Exhibition Track.
Page generated on 2022-08-10 11:19:33 +0000
Benchmarks: 3630 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 | 2906 | 940863.346 | 941126.905 | 724 | 722 | 2 |
cvc5 | 0 | 1652 | 2165541.549 | 2163455.215 | 1978 | 1671 | 2 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 2906 | 941139.626 | 941088.845 | 724 | 722 | 2 |
cvc5 | 0 | 1652 | 2165924.679 | 2163369.625 | 1978 | 1671 | 2 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.