SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

QF_AUFLIA (Incremental Track)

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

Results were generated on 2026-07-25

Benchmarks: 72
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
cvc50367669419573.0819573.08072090
SMTInterpol0352720320334.2920334.290720140
Yices2028973261604.281604.28072000
OpenSMT02921545906.735906.73072040
z3-BooledASS ne00
(base +0)		0.430.55072000
z3-BooledASS-base n000.000.00072000
(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
Yices20250585113.35113.350571500
cvc505105093.6593.650462630
SMTInterpol044225181.56181.560472500
OpenSMT02731858.1658.16064800
z3-BooledASS ne00
(base +0)		0.430.55072000
z3-BooledASS-base n000.000.00072000
(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