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

Competition results for the QF_UF logic in the Incremental Track.

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

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

Winners

Parallel Performance
Yices2

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
Yices2 0 15814135.018112.83300 0
z3-4.8.17n 0 15814295.046270.04900 0
2021-z3n 0 15814349.706326.88900 0
cvc5 0 158141009.88956.06500 0
smtinterpol 0 158144322.3471802.31400 0
OpenSMT 0 157831179.7681155.378310 0
MathSATn 0 716184.656167.228150980 0

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