SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

QF_NIA (Incremental Track)

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

Results were generated on 2026-07-25

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

Winners

Parallel PerformanceSAT Performance (parallel)UNSAT Performance (parallel)24 seconds Performance (parallel)
SMTInterpol--Yices2

Parallel Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedUnsolvedAbstainedTimeoutMemout
SMTInterpol0419896929802.3629450.2201190180
cvc501634839124597.97124604.76011901020
Yices2010201184065.6584067.5601190710
z3-BooledASS ne00
(base +0)		0.700.900119000
z3-BooledASS-base n000.000.000119000
(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
Yices2011034129.96129.960249530
SMTInterpol01575261.88261.880635600
cvc504572.352.350211710
z3-BooledASS ne00
(base +0)		0.700.900119000
z3-BooledASS-base n000.000.000119000
(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