The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_FPArith division in the Proof Exhibition Track.
Page generated on 2022-08-10 11:19:33 +0000
Benchmarks: 13848 Time Limit: 1200 seconds Memory Limit: 60 GB
Logics:
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
---|---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 10685 | 3750329.676 | 3750905.492 | 3163 | 0 | 3043 | 77 |
cvc5 | 0 | 10628 | 3828924.134 | 3829384.467 | 3220 | 0 | 3104 | 77 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Abstained | Timeout | Memout |
---|---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 10685 | 3750696.966 | 3750814.052 | 3163 | 0 | 3043 | 77 |
cvc5 | 0 | 10628 | 3829469.124 | 3829230.797 | 3220 | 0 | 3104 | 77 |
n Non-competing.
Abstained: Total of benchmarks in logics in this division that solver chose to abstain from. For SAT/UNSAT scores, this column also includes benchmarks not known to be SAT/UNSAT.