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

Competition results for the QF_FPLRA logic in the Incremental Track.

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

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

Winners

Parallel Performance
Bitwuzla

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
Bitwuzla 0 480.1710.16900 0
cvc5 0 480.3510.34600 0
MathSATn 0 480.5010.49900 0
z3-4.8.17n 0 4819.03519.0400 0

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