The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the UFNIA logic in the Incremental Track.
Page generated on 2022-08-10 11:18:22 +0000
Benchmarks: 2031 Time Limit: 1200 seconds Memory Limit: 60 GB
Parallel Performance |
---|
cvc5 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
z3-4.8.17n | 0 | 96541 | 1338651.852 | 1338512.825 | 259501 | 978 | 4 |
2020-z3n | 0 | 95650 | 1349168.636 | 1349138.005 | 260392 | 987 | 4 |
cvc5 | 0 | 30790 | 1023455.468 | 1023285.593 | 325252 | 818 | 0 |
smtinterpol | 0 | 15416 | 1329277.22 | 1312991.05 | 340626 | 1058 | 0 |
UltimateEliminator+MathSAT | 0 | 0 | 8815.141 | 3913.037 | 356042 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.