SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

QF_UFBVDT (Model Validation Track)

Competition results for the QF_UFBVDT logic in the Model Validation Track. Chart

Results were generated on 2026-07-25

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

Winners

Sequential PerformanceParallel PerformanceSAT Performance (parallel)UNSAT Performance (parallel)24 seconds Performance (parallel)
cvc5cvc5cvc5-cvc5

Sequential Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATUnsolvedAbstainedTimeoutMemout
cvc50448454.528461.1044443030
z3-BooledASS029
(base +5)		9586.479591.122929180180
SMTInterpol000.000.0000470270
z3-BooledASS-base n0247389.947393.672424230220
(base +/- n): for derived solvers: increment over base solver
n: non-competing solver

Parallel Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATUnsolvedAbstainedTimeoutMemout
cvc50448454.528461.1044443030
z3-BooledASS029
(base +5)		9586.479591.122929180180
SMTInterpol000.000.0000470270
z3-BooledASS-base n0247389.947393.672424230220
(base +/- n): for derived solvers: increment over base solver
n: non-competing solver

SAT Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATUnsolvedAbstainedTimeoutMemout
cvc50448454.528461.1044443030
z3-BooledASS029
(base +5)		9586.479591.122929180180
SMTInterpol000.000.0000470270
z3-BooledASS-base n0247389.947393.672424230220
(base +/- n): for derived solvers: increment over base solver
n: non-competing solver

24 seconds Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATUnsolvedAbstainedTimeoutMemout
cvc5021167.22169.84212102600
z3-BooledASS ne09
(base +1)		36.9738.139903800
SMTInterpol000.000.000083900
z3-BooledASS-base n0817.2118.228803900
(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