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 Performance Parallel Performance SAT Performance (parallel) UNSAT Performance (parallel) 24 seconds Performance (parallel)
Bitwuzla Bitwuzla - Bitwuzla cvc5

Sequential Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Solved UNSAT Unsolved Abstained Timeout Memout
Bitwuzla 0 2 109.90 110.18 2 0 2 0 0 0 0
cvc5 0 1 0.23 0.35 1 0 1 1 0 0 0
UltimateEliminator+MathSAT 0 1 33.26 21.19 1 0 1 1 0 0 0

Parallel Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Solved UNSAT Unsolved Abstained Timeout Memout
Bitwuzla 0 2 109.90 110.18 2 0 2 0 0 0 0
cvc5 0 1 0.23 0.35 1 0 1 1 0 0 0
UltimateEliminator+MathSAT 0 1 33.26 21.19 1 0 1 1 0 0 0

UNSAT Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Solved UNSAT Unsolved Abstained Timeout Memout
Bitwuzla 0 2 109.90 110.18 2 0 2 0 0 0 0
cvc5 0 1 0.23 0.35 1 0 1 1 0 0 0
UltimateEliminator+MathSAT 0 1 33.26 21.19 1 0 1 1 0 0 0

24 seconds Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Solved UNSAT Unsolved Abstained Timeout Memout
cvc5 0 1 0.23 0.35 1 0 1 0 1 0 0
Bitwuzla 0 1 0.30 0.42 1 0 1 0 1 0 0
UltimateEliminator+MathSAT 0 1 33.26 21.19 1 0 1 0 1 0 0