SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

QF_LIA (Incremental Track)

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

Results were generated on 2026-07-25

Benchmarks: 69
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
Yices201478378826304.0926304.090690150
SMTInterpol01449498543907.2643907.260690350
cvc50386137461089.9561089.950690540
OpenSMT0115078952463.1952463.190690430
z3-BooledASS ne00
(base +0)		0.410.52069000
z3-BooledASS-base n000.000.00069000
(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
Yices20874094104.35104.350185100
OpenSMT0171784.5384.530135600
cvc50111163.8063.80096000
SMTInterpol060635.7535.75046500
z3-BooledASS ne00
(base +0)		0.410.52069000
z3-BooledASS-base n000.000.00069000
(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