SMT-COMP 2025

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2025

QF_Bitvec (Incremental Track)

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

Results were generated on 2025-08-11

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

Logics:

Winners

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

Parallel Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Unsolved Abstained Timeout Memout
Yices2 0 14610 19738.75 19738.75 0 1305 0 12 0
Bitwuzla 0 14582 16807.96 16807.96 0 1305 0 10 0
cvc5 0 14087 46037.75 46037.95 0 1305 0 15 0
SMTInterpol 0 8798 419150.07 406961.25 0 1305 0 317 0

24 seconds Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Unsolved Abstained Timeout Memout
Yices2 0 9442 1643.42 1643.42 0 1257 48 1 0
Bitwuzla 0 9208 1833.42 1833.42 0 1230 75 0 0
SMTInterpol 0 5167 2482.92 2482.92 0 794 511 7 0
cvc5 0 2744 1526.42 1526.42 0 1087 218 0 0