SMT-COMP 2025

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2025

QF_FPArith (Incremental Track)

Competition results for the QF_FPArith division in the Incremental Track. Chart

Results were generated on 2025-08-11

Benchmarks: 9752
Time Limit: 1200 seconds
Memory Limit: 30720 GB

Logics:

Winners

Parallel Performance SAT Performance (parallel) UNSAT Performance (parallel) 24 seconds Performance (parallel)
Bitwuzla - - Bitwuzla

Parallel Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Unsolved Abstained Timeout Memout
Bitwuzla 0 311283 49987.85 49998.59 0 9752 0 26 0
cvc5 0 281177 1098222.25 1098232.81 0 9752 0 1277 2

24 seconds Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Unsolved Abstained Timeout Memout
Bitwuzla 0 306062 4491.71 4491.71 0 9601 151 5 0
cvc5 0 192554 14844.39 14844.39 0 7498 2254 148 0