SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

AUFNIRA (Incremental Track)

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

Results were generated on 2026-07-25

Benchmarks: 165
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
cvc50304929850.9729852.5101650260
SMTInterpol0182991901.1171500.9101650470
z3-BooledASS ne00
(base +0)		0.971.250165000
UltimateEliminator+MathSAT00582.57217.950165000
z3-BooledASS-base n000.000.000165000
(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
cvc50301637.3237.3201353010
SMTInterpol01533138.95138.950887700
z3-BooledASS ne00
(base +0)		0.971.250165000
UltimateEliminator+MathSAT00582.57217.950165000
z3-BooledASS-base n000.000.000165000
(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