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

Competition results for the QF_ABVFPLRA logic in the Incremental Track.

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

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

Winners

Parallel Performance
cvc5

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
MathSATn 0 187675.29575.24900 0
cvc5 0 1876155.864155.65400 0
Bitwuzla 0 1876356.278356.31200 0

n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.