SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

QF_AUFBVNIA (Incremental Track)

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

Results were generated on 2026-07-25

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

Winners

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

Parallel Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedUnsolvedAbstainedTimeoutMemout
cvc506417629.0017627.570440120
SMTInterpol03016767.3016485.36044080
Yices20296.055.44044000
z3-BooledASS ne00
(base +0)		0.280.35044000
z3-BooledASS-base n000.000.00044000
(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
Yices20296.055.44044000
cvc502980.0280.020172700
SMTInterpol014121.23121.230202400
z3-BooledASS ne00
(base +0)		0.280.35044000
z3-BooledASS-base n000.000.00044000
(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