The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the AUFLIA logic in the Proof Exhibition Track.
Page generated on 2023-07-06 16:06:18 +0000
Benchmarks: 677 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 | 581 | 5158.443 | 5158.361 | 96 | 96 | 0 |
cvc5 | 0 | 581 | 5295.761 | 5293.093 | 96 | 96 | 0 |
SMTInterpol | 0 | 499 | 7253.591 | 5432.618 | 178 | 171 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 581 | 5158.443 | 5158.361 | 96 | 96 | 0 |
cvc5 | 0 | 581 | 5295.761 | 5293.093 | 96 | 96 | 0 |
SMTInterpol | 0 | 499 | 7253.591 | 5432.618 | 178 | 160 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.