SMT-COMP 2025

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2025

QF_FPLRA (Model Validation Track)

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

Results were generated on 2025-08-11

Benchmarks: 51
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 - Bitwuzla

Sequential Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Unsolved Abstained Timeout Memout
Bitwuzla 0 51 830.29 836.75 51 51 0 0 0 0
cvc5 0 45 920.88 926.52 45 45 6 0 6 0

Parallel Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Unsolved Abstained Timeout Memout
Bitwuzla 0 51 830.29 836.75 51 51 0 0 0 0
cvc5 0 45 920.88 926.52 45 45 6 0 6 0

SAT Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Unsolved Abstained Timeout Memout
Bitwuzla 0 51 830.29 836.75 51 51 0 0 0 0
cvc5 0 45 920.88 926.52 45 45 6 0 6 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 45 16.03 21.51 45 45 0 6 0 0
cvc5 0 41 13.90 18.89 41 41 0 10 0 0