SMT-COMP 2025

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2025

QF_FPArith (Model Validation Track)

Competition results for the QF_FPArith division in the Model Validation Track. Chart

Results were generated on 2025-08-11

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

Logics:

Winners

Sequential Performance Parallel Performance SAT Performance (parallel) UNSAT Performance (parallel) 24 seconds Performance (parallel)
cvc5 cvc5 cvc5 - Bitwuzla

Sequential Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Unsolved Abstained Timeout Memout
cvc5 0 24354 13057.23 16037.05 24354 24354 15 0 9 0
Bitwuzla 0 24343 7910.63 10869.61 24343 24343 2 24 1 0

Parallel Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Unsolved Abstained Timeout Memout
cvc5 0 24354 13057.23 16037.05 24354 24354 15 0 9 0
Bitwuzla 0 24343 7910.63 10869.61 24343 24343 2 24 1 0

SAT Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Unsolved Abstained Timeout Memout
cvc5 0 24354 13057.23 16037.05 24354 24354 15 0 9 0
Bitwuzla 0 24343 7910.63 10869.61 24343 24343 2 24 1 0

24 seconds Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Unsolved Abstained Timeout Memout
Bitwuzla 0 24321 3975.77 6931.09 24321 24321 1 47 0 0
cvc5 0 24293 5043.35 8014.30 24293 24293 6 70 0 0