SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

QF_ABV (Incremental Track)

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

Results were generated on 2026-07-25

Benchmarks: 527
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
Bitwuzla0141417903.7517903.110527080
Yices2014007559.347559.3805270100
cvc501050180161.22180141.99052701514
SMTInterpol091265882.4564007.3605270410
z3-BooledASS ne00
(base +0)		3.214.100527000
z3-BooledASS-base n000.000.000527000
(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
Yices20966373.16373.1605081930
Bitwuzla0864749.36749.3604824500
SMTInterpol06601067.731067.73038014720
cvc50650596.38596.38035317440
z3-BooledASS ne00
(base +0)		3.214.100527000
z3-BooledASS-base n000.000.000527000
(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