SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

FPArith (Incremental Track)

Competition results for the FPArith division in the Incremental Track. Chart

Results were generated on 2026-07-25

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

Logics:

Winners

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

Parallel Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedUnsolvedAbstainedTimeoutMemout
Bitwuzla05240700.89700.89010020
Bitwuzla-fixed n05240702.54702.54010020
cvc50323024.5924.59010070
UltimateEliminator+MathSAT02388110.53110.53010000
z3-BooledASS ne00
(base +0)		0.060.07010000
z3-BooledASS-base n000.000.00010000
(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
cvc50323024.5924.59010070
Bitwuzla-fixed n0202351.3751.3708210
Bitwuzla0202351.7951.7908210
UltimateEliminator+MathSAT072159.7359.7308200
z3-BooledASS ne00
(base +0)		0.060.07010000
z3-BooledASS-base n000.000.00010000
(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