SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

Arith (Incremental Track)

Competition results for the Arith division in the Incremental Track. Chart

Results were generated on 2026-07-25

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

Logics:

Winners

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

Parallel Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedUnsolvedAbstainedTimeoutMemout
cvc504136282.2182.21011000
SMTInterpol0381291246.661246.66011010
UltimateEliminator+MathSAT031013182.24182.24011000
z3-BooledASS ne00
(base +0)		0.060.08011000
z3-BooledASS-base n000.000.00011000
(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
SMTInterpol03740848.9048.90010100
cvc503283627.5527.55010100
UltimateEliminator+MathSAT01909092.2892.2809200
z3-BooledASS ne00
(base +0)		0.060.08011000
z3-BooledASS-base n000.000.00011000
(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