SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

QF_LRA (Parallel Track)

Competition results for the QF_LRA logic in the Parallel Track. Chart

Results were generated on 2026-07-25

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

Winners

Sequential PerformanceParallel PerformanceSAT Performance (parallel)UNSAT Performance (parallel)24 seconds Performance (parallel)
-OpenSMT-SMTSOpenSMT-SMTSz3-parallelOpenSMT-SMTS

Parallel Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeoutMemout
OpenSMT-SMTS022
(base +4)
972034.917733.23221111180180
z3-parallel03257393.102174.86303370370
OpenSMT-SMTS-base n0187200.967204.6618711220220
(base +/- n): for derived solvers: increment over base solver
n: non-competing solver

SAT Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeoutMemout
OpenSMT-SMTS011
(base +4)
715199.655681.721111052450
z3-parallel000.000.000001624160
OpenSMT-SMTS-base n073619.413621.1577092490
(base +/- n): for derived solvers: increment over base solver
n: non-competing solver

UNSAT Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeoutMemout
OpenSMT-SMTS ne011
(base +0)
256835.262051.501101162360
z3-parallel03257393.102174.863031423140
OpenSMT-SMTS-base n0113581.563583.511101162360
(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 ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeoutMemout
OpenSMT-SMTS012515.0720.9911003900
(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