The International Satisfiability Modulo Theories (SMT) Competition.
    Home
    Introduction
    Benchmark Submission
    Publications
    SMT-LIB
    Previous Editions
  
Competition results for the BVFP logic in the Incremental Track.
Page generated on 2022-08-10 11:18:21 +0000
Benchmarks: 1 Time Limit: 1200 seconds Memory Limit: 60 GB
| Parallel Performance | 
|---|
| Bitwuzla | 
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout | 
|---|---|---|---|---|---|---|---|
| Bitwuzla | 0 | 274 | 60.417 | 60.407 | 184 | 0 | 0 | 
| 2019-CVC4-incn | 0 | 260 | 1200.0 | 1200.0 | 198 | 1 | 0 | 
| cvc5 | 0 | 260 | 1200.0 | 1200.0 | 198 | 1 | 0 | 
| UltimateEliminator+MathSAT | 0 | 231 | 47.33 | 40.956 | 227 | 0 | 0 | 
  
    n Non-competing.
  
    N/A: Benchmarks not known to be SAT/UNSAT, respectively.