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

Competition results for the QF_FPArith division in the Incremental Track.

Page generated on 2023-07-06 16:05:24 +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 31641736869.0637934.4759035 0
2022-Bitwuzlan 0 31637327097.4728131.8103033 0
cvc5 0 2758301642851.621644196.594064601626 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.