SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

QF_UFLIA (Incremental Track)

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

Results were generated on 2026-07-25

Benchmarks: 386
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
Yices2048440566426.8966426.8903860690
SMTInterpol048290491511.1491511.1403860950
cvc5039533995806.9895806.9803860770
OpenSMT03238599739.8699739.8603860850
z3-BooledASS ne00
(base +0)		2.302.930386000
z3-BooledASS-base n000.000.000386000
(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
Yices20292332.3932.3902978900
OpenSMT01133202.21202.21027511100
cvc5086365.9265.92028010600
SMTInterpol0810199.64199.64027810800
z3-BooledASS ne00
(base +0)		2.302.930386000
z3-BooledASS-base n000.000.000386000
(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