SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

QF_AUFBV (Incremental Track)

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

Results were generated on 2026-07-25

Benchmarks: 31
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
Bitwuzla09672598.402598.40031000
Yices209462863.332863.33031060
cvc507266713.536713.530310160
SMTInterpol01025694.615549.770310190
z3-BooledASS ne00
(base +0)		0.210.26031000
z3-BooledASS-base n000.000.00031000
(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
Yices2025950.0950.090201120
Bitwuzla021638.5638.560181300
cvc506347.6847.680131830
SMTInterpol060143.19143.190229100
z3-BooledASS ne00
(base +0)		0.210.26031000
z3-BooledASS-base n000.000.00031000
(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