SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

QF_Equality_LinearArith (Parallel Track)

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

Results were generated on 2026-07-25

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

Logics:

Winners

Sequential PerformanceParallel PerformanceSAT Performance (parallel)UNSAT Performance (parallel)24 seconds Performance (parallel)
-z3-parallelz3-parallelz3-parallel-

Parallel Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeoutMemout
z3-parallel018361914.415377.3618135590590
OpenSMT-SMTS ne06
(base -6)
312390.482462.32633710670
OpenSMT-SMTS-base n0128589.018591.8912111650650
(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

SAT Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeoutMemout
z3-parallel013223259.933465.511313046040
OpenSMT-SMTS ne03
(base +2)
151969.691196.213301460140
OpenSMT-SMTS-base n01211.43211.581101660160
(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

UNSAT Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeoutMemout
z3-parallel05138654.481911.855053537350
OpenSMT-SMTS ne03
(base -8)
160420.791266.113033737330
OpenSMT-SMTS-base n0118377.578380.31110112937290
(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