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

Competition results for the QF_UFLRA logic in the Incremental Track.

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

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

Winners

Parallel Performance
Yices2

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
z3-4.8.17n 0 815412862.10712518.2410 0
2020-z3n 0 815413590.37513268.09910 0
MathSATn 0 814715540.39615175.92384 0
Yices2 0 813317179.16416861.285226 0
cvc5 0 811469450.72468960.544122 0
OpenSMT 0 806986148.41585876.9838646 0
smtinterpol 0 798775714.77363272.90716833 0

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