SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

UFNIA (Incremental Track)

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

Results were generated on 2026-07-25

Benchmarks: 806
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
cvc5014881277207.42277221.26080603530
SMTInterpol07105755770.44587325.34080605330
z3-BooledASS ne00
(base +0)		4.886.230806000
UltimateEliminator+MathSAT003022.651120.900806000
z3-BooledASS-base n000.000.000806000
(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
cvc50107701368.781368.7805063001200
SMTInterpol03979394.61394.610155651480
z3-BooledASS ne00
(base +0)		4.886.230806000
UltimateEliminator+MathSAT003022.651120.900806000
z3-BooledASS-base n000.000.000806000
(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