SMT-COMP 2025

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2025

UFBVFP (Single Query Track)

Competition results for the UFBVFP logic in the Single Query Track. Chart

Results were generated on 2025-08-11

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

Winners

Sequential PerformanceParallel PerformanceSAT Performance (parallel)UNSAT Performance (parallel)24 seconds Performance (parallel)
BitwuzlaBitwuzla-Bitwuzlacvc5

Sequential Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeoutMemout
Bitwuzla02109.90110.182020000
cvc5010.230.351011000
UltimateEliminator+MathSAT0133.2621.191011000

Parallel Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeoutMemout
Bitwuzla02109.90110.182020000
cvc5010.230.351011000
UltimateEliminator+MathSAT0133.2621.191011000

UNSAT Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeoutMemout
Bitwuzla02109.90110.182020000
cvc5010.230.351011000
UltimateEliminator+MathSAT0133.2621.191011000

24 seconds Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeoutMemout
cvc5010.230.351010100
Bitwuzla010.300.421010100
UltimateEliminator+MathSAT0133.2621.191010100