SMT-COMP 2025

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2025

QF_UFFP (Unsat Core Track)

Competition results for the QF_UFFP logic in the Unsat Core 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)
- - - - -

Sequential Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved UNSAT Unsolved Abstained Timeout Memout
Bitwuzla 0 0 0.34 0.58 2 2 0 0 0 0
cvc5 0 0 0.73 0.97 2 2 0 0 0 0

Parallel Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved UNSAT Unsolved Abstained Timeout Memout
Bitwuzla 0 0 0.34 0.58 2 2 0 0 0 0
cvc5 0 0 0.73 0.97 2 2 0 0 0 0

UNSAT Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved UNSAT Unsolved Abstained Timeout Memout
Bitwuzla 0 0 0.34 0.58 2 2 0 0 0 0
cvc5 0 0 0.73 0.97 2 2 0 0 0 0

24 seconds Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved UNSAT Unsolved Abstained Timeout Memout
Bitwuzla 0 0 0.34 0.58 2 2 0 0 0 0
cvc5 0 0 0.73 0.97 2 2 0 0 0 0