SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

QF_AUFBVLIA (Incremental Track)

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

Results were generated on 2026-07-25

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

Winners

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

Parallel Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedUnsolvedAbstainedTimeoutMemout
Yices205526611.276610.270300040
SMTInterpol052273302.7272005.3303000340
cvc5050970854.2670843.3603000461
z3-BooledASS ne00
(base +0)
1.782.270300000
z3-BooledASS-base n000.000.000300000
(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
Yices20525701.17701.1702841600
cvc50308790.10790.10017212800
SMTInterpol03011028.151028.15016413600
z3-BooledASS ne00
(base +0)
1.782.270300000
z3-BooledASS-base n000.000.000300000
(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