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 (Incremental Track)

Competition results for the QF_FPArith division in the Incremental Track.

Page generated on 2022-08-10 11:18:21 +0000

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

Logics:

Winners

Parallel Performance
Bitwuzla

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedAbstainedTimeout Memout
Bitwuzla 0 31121779622.34379490.03470040 0
MathSATn 0 310717191152.933190523.987570063 0
cvc5 0 2792291954774.1161954200.9873205801333 0
2021-Bitwuzla - fixedn 0 27655680224.92779963.41571041 0
z3-4.8.17n 0 267054236.30254238.16152032 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.