SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

UFLRA (Incremental Track)

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

Results were generated on 2026-07-25

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

Winners

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

Parallel Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedUnsolvedAbstainedTimeoutMemout
cvc509080414783.3514783.350587040
SMTInterpol073888212324.56212324.56058701350
z3-BooledASS ne00
(base +0)		3.524.490587000
UltimateEliminator+MathSAT002047.88768.390587000
z3-BooledASS-base n000.000.000587000
(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
cvc50823321302.491302.4904959200
SMTInterpol018090735.41735.41024234500
z3-BooledASS ne00
(base +0)		3.524.490587000
UltimateEliminator+MathSAT002047.88768.390587000
z3-BooledASS-base n000.000.000587000
(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