The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the UF logic in the Proof Exhibition Track.
Page generated on 2023-07-06 16:06:18 +0000
Benchmarks: 977 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 | 818 | 6314.782 | 6307.722 | 159 | 159 | 0 |
cvc5 | 0 | 797 | 6817.607 | 6785.18 | 180 | 172 | 0 |
SMTInterpol | 0 | 468 | 31752.731 | 23930.853 | 509 | 510 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 818 | 6314.782 | 6307.722 | 159 | 159 | 0 |
cvc5 | 0 | 797 | 6817.607 | 6785.18 | 180 | 172 | 0 |
SMTInterpol | 0 | 468 | 32266.821 | 23749.133 | 509 | 486 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.