SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions

SMT-COMP 2022

Rules
Benchmarks
Tools
Specs
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 2022-08-10 11:19:11 +0000

Benchmarks: 17301
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 17294 12477.011 12568.0114 0
cvc5 0 17271 23574.227 23566.76112 0
z3-4.8.17n 0 17254 56643.884 63016.08225 2
MathSATn 0 15796 32921.333 32856.93221 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreAbstainedTimeout Memout
Bitwuzla 0 1729412478.85112567.7514 0
cvc5 0 1727123576.95723566.20112 0
z3-4.8.17n 0 1725457246.66463014.86225 2
MathSATn 0 1579632924.49332855.93221 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.