SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

QF_UFBV (Incremental Track)

Competition results for the QF_UFBV logic in the Incremental Track. Chart

Results were generated on 2026-07-25

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

Winners

Parallel PerformanceSAT Performance (parallel)UNSAT Performance (parallel)24 seconds Performance (parallel)
Bitwuzla--Yices2

Parallel Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedUnsolvedAbstainedTimeoutMemout
Bitwuzla01587640.82640.820633000
Yices201582288.86288.860633020
cvc5014334331.884331.880633040
SMTInterpol01119209400.16205819.97063301010
z3-BooledASS ne00
(base +0)		3.854.920633000
z3-BooledASS-base n000.000.000633000
(base +/- n): for derived solvers: increment over base solver
ne: not eligible for winning as it does not substantially improve over the base solver (at least 10 % improvement in PAR2 score) n: non-competing solver

24 seconds Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedUnsolvedAbstainedTimeoutMemout
Yices201318111.41111.410630310
Bitwuzla01304195.72195.720630300
cvc5012381018.981018.9806191400
SMTInterpol04341863.431863.43021342030
z3-BooledASS ne00
(base +0)		3.854.920633000
z3-BooledASS-base n000.000.000633000
(base +/- n): for derived solvers: increment over base solver
ne: not eligible for winning as it does not substantially improve over the base solver (at least 10 % improvement in PAR2 score) n: non-competing solver