SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

QF_UFIDL (Parallel Track)

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

Results were generated on 2026-07-25

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

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
OpenSMT-SMTS ne04
(base -8)
212683.901678.31413340300
z3-parallel03118273.911360.18312350350
OpenSMT-SMTS-base n0128589.018591.8912111260260
(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-parallel01789.5872.1411003700
OpenSMT-SMTS ne01
(base +0)
52263.11412.2011003700
OpenSMT-SMTS-base n01211.43211.5811003700
(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
OpenSMT-SMTS ne03
(base -8)
160420.791266.11303341300
z3-parallel02117484.331288.04202351350
OpenSMT-SMTS-base n0118377.578380.3111011261260
(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