SMT-COMP 2025

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2025

QF_ABVFP (Unsat Core Track)

Competition results for the QF_ABVFP logic in the Unsat Core Track. Chart

Results were generated on 2025-08-11

Benchmarks: 1967
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 UNSAT Unsolved Abstained Timeout Memout
Bitwuzla 0 16605 1017.47 1261.67 1966 1966 1 0 0 0
cvc5 0 16416 10757.18 11001.75 1962 1962 5 0 5 0

Parallel Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved UNSAT Unsolved Abstained Timeout Memout
Bitwuzla 0 16605 1017.47 1261.67 1966 1966 1 0 0 0
cvc5 0 16416 10757.18 11001.75 1962 1962 5 0 5 0

UNSAT Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved UNSAT Unsolved Abstained Timeout Memout
Bitwuzla 0 16605 1017.47 1261.67 1966 1966 1 0 0 0
cvc5 0 16416 10757.18 11001.75 1962 1962 5 0 5 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 16603 653.33 896.97 1962 1962 1 4 0 0
cvc5 0 16098 2003.22 2238.54 1900 1900 0 67 0 0