SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions

SMT-COMP 2023

Rules
Benchmarks
Specs
Model Validation Track
Proof Exhibition Track
Parallel & Cloud Tracks
Participants
Results
Statistics
Comparisons
Slides

QF_BVFP (Unsat Core Track)

Competition results for the QF_BVFP logic in the Unsat Core Track.

Page generated on 2023-07-06 16:05:43 +0000

Benchmarks: 1589
Time Limit: 1200 seconds
Memory Limit: 60 GB

Winners

Sequential PerformanceParallel Performance
BitwuzlaBitwuzla

Sequential Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreTimeout Memout
2022-z3-4.8.17n 0 14446 15030.322 15025.42719 0
Bitwuzla Fixedn 0 14297 728.569 730.3142 0
Bitwuzla 0 14297 731.641 732.3862 0
cvc5 0 13933 1968.259 1924.8082 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreTimeout Memout
2022-z3-4.8.17n 0 1444615030.32215025.42719 0
Bitwuzla Fixedn 0 14297728.569730.3142 0
Bitwuzla 0 14297731.641732.3862 0
cvc5 0 139331968.2591924.8082 0

n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.