SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

LIA (Incremental Track)

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

Results were generated on 2026-07-25

Benchmarks: 6
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
cvc502539315.9515.9506000
SMTInterpol02539325.7625.7606000
UltimateEliminator+MathSAT01504468.3168.3106000
z3-BooledASS ne00
(base +0)		0.040.0506000
z3-BooledASS-base n000.000.0006000
(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
cvc502539315.9515.9506000
SMTInterpol02539325.7625.7606000
UltimateEliminator+MathSAT01504468.3168.3106000
z3-BooledASS ne00
(base +0)		0.040.0506000
z3-BooledASS-base n000.000.0006000
(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