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

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

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

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

Logics:

Winners

Sequential PerformanceParallel Performance
BitwuzlaBitwuzla

Sequential Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreAbstainedTimeout Memout
z3-4.8.17n 0 31486 997833.042 997744.01777 0
Bitwuzla 0 31273 50222.024 50165.68922 0
2021-Bitwuzlan 0 31082 51841.952 51773.72528 0
cvc5 0 27683 718282.452 718304.343519 0
MathSATn 0 749 395.805 404.10 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreAbstainedTimeout Memout
z3-4.8.17n 0 31486997966.062997706.17777 0
Bitwuzla 0 3127350227.48450165.04922 0
2021-Bitwuzlan 0 3108251845.42251772.34528 0
cvc5 0 27683718348.162718285.193519 0
MathSATn 0 749395.805404.10 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.