SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

QF_UFLRA (Incremental Track)

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

Results were generated on 2026-07-25

Benchmarks: 705
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
cvc50384510102.0510101.520705020
Yices2038403691.563691.560705020
OpenSMT0382714092.7314091.1307050130
SMTInterpol0378711101.5611101.5607050100
z3-BooledASS ne00
(base +0)		4.225.410705000
z3-BooledASS-base n000.000.000705000
(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
Yices203614550.93550.9306901500
OpenSMT03292567.40567.4006505540
cvc503221996.87996.8706555000
SMTInterpol031131355.841355.8406426310
z3-BooledASS ne00
(base +0)		4.225.410705000
z3-BooledASS-base n000.000.000705000
(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