SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

QF_FPArith (Incremental Track)

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

Results were generated on 2026-07-25

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

Logics:

Winners

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

Parallel Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedUnsolvedAbstainedTimeoutMemout
Bitwuzla01061369051.209050.7502780040
cvc5097511282104.34282104.100278003230
z3-BooledASS ne00
(base +0)		16.5921.1502780000
z3-BooledASS-base n000.000.0002780000
(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
Bitwuzla0820921609.701609.70027255520
cvc50750054048.514048.5102202578450
z3-BooledASS ne00
(base +0)		16.5921.1502780000
z3-BooledASS-base n000.000.0002780000
(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