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_FPArith (Model Validation Track)

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

Page generated on 2023-07-06 16:06:00 +0000

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

Logics: This division is experimental. Solvers are only ranked by performance, but no winner is selected.

Sequential Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreAbstainedTimeout Memout
Bitwuzla 0 24362 6118.691 6161.28243 0
Bitwuzla Fixedn 0 24361 6131.126 6203.6543 0
cvc5 0 24351 9504.916 9466.66756 0
2022-Bitwuzlan 0 17289 7472.056 7513.25639 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreAbstainedTimeout Memout
Bitwuzla 0 243626118.6916161.28243 0
Bitwuzla Fixedn 0 243616131.1266203.6543 0
cvc5 0 243519504.9169466.66756 0
2022-Bitwuzlan 0 172897472.0567513.25639 0

n Non-competing.
Abstained: Total of benchmarks in logics in this division that solver chose to abstain from. For SAT/UNSAT scores, this column also includes benchmarks not known to be SAT/UNSAT.