SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

QF_Equality_NonLinearArith (Incremental Track)

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

Results were generated on 2026-07-25

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

Logics:

Winners

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

Parallel Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedUnsolvedAbstainedTimeoutMemout
SMTInterpol0148584673.51673.510507000
cvc501215479004.949005.010507080
Yices20463408413.118413.1105070130
z3-BooledASS ne00
(base +0)		3.063.890507000
z3-BooledASS-base n000.000.000507000
(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
SMTInterpol036955542.52542.520504300
cvc5025240987.53987.5304634470
Yices2011862368.10368.1004852260
z3-BooledASS ne00
(base +0)		3.063.890507000
z3-BooledASS-base n000.000.000507000
(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