SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

QF_Equality_LinearArith (Incremental Track)

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

Results were generated on 2026-07-25

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

Logics:

Winners

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

Parallel Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedUnsolvedAbstainedTimeoutMemout
cvc504606276127021.56127021.03012070880
SMTInterpol04544292128496.18128496.180120701190
Yices20391595372040.9872040.98012070720
OpenSMT0438426171008.49171006.890120701430
z3-BooledASS ne00
(base +0)		7.209.2201207000
z3-BooledASS-base n000.000.0001207000
(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
Yices20562162769.21769.210108212500
cvc503215731504.511504.510101719030
SMTInterpol03197652358.962358.960100320410
OpenSMT031743827.77827.78098921840
z3-BooledASS ne00
(base +0)		7.209.2201207000
z3-BooledASS-base n000.000.0001207000
(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