SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

UFDTNIA (Incremental Track)

Competition results for the UFDTNIA logic in the Incremental Track. Chart

Results were generated on 2026-07-25

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

Winners

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

Parallel Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedUnsolvedAbstainedTimeoutMemout
cvc5035947624.4847626.0801390580
SMTInterpol050161739.81128527.43013901080
z3-BooledASS ne00
(base +0)		0.821.060139000
z3-BooledASS-base n000.000.000139000
(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
cvc5028094.6294.6209445190
SMTInterpol04633.4933.4903210720
z3-BooledASS ne00
(base +0)		0.821.060139000
z3-BooledASS-base n000.000.000139000
(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