SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

QF_LinearRealArith (Incremental Track)

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

Results were generated on 2026-07-25

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

Logics:

Winners

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

Parallel Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedUnsolvedAbstainedTimeoutMemout
OpenSMT010324799.154799.15010050
Yices2092210577.2710577.270100100
cvc506909821.209821.200100100
SMTInterpol05208803.228803.220100100
z3-BooledASS ne00
(base +0)		0.060.08010000
z3-BooledASS-base n000.000.00010000
(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
z3-BooledASS ne00
(base +0)		0.060.08010000
z3-BooledASS-base n000.000.00010000
(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