SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

QF_ALIA (Incremental Track)

Competition results for the QF_ALIA 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
cvc505303981539.451539.45044000
SMTInterpol05303985549.185549.18044000
Yices20530382318.26318.26044010
OpenSMT011006051269.1751269.170440410
z3-BooledASS ne00
(base +0)		0.260.33044000
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
Yices2030504072.5572.55038600
SMTInterpol0271617621.91621.91036800
cvc50266439348.07348.07036800
z3-BooledASS ne00
(base +0)		0.260.33044000
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