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 (Unsat Core Track)

Competition results for the QF_FPArith division in the Unsat Core Track.

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

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

Logics:

Winners

Sequential PerformanceParallel Performance
cvc5cvc5

Sequential Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreAbstainedTimeout Memout
Bitwuzla Fixedn 0 33798 12043.377 12103.75228 0
cvc5 0 32370 38328.11 38218.47451 0
2022-z3-4.8.17n 0 32251 58461.62 58184.488810 0
Bitwuzla 17* 33716 13194.716 13234.62327 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreAbstainedTimeout Memout
Bitwuzla Fixedn 0 3379812043.37712103.75228 0
cvc5 0 3237038328.1138218.47451 0
2022-z3-4.8.17n 0 3225158461.6258184.488810 0
Bitwuzla 17* 3371613194.71613234.62327 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.
* The error score is caused by Bitwuzla using the wrong names in the unsat core output (syntactic problems). It does not indicate an unsoundness.