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

Competition results for the QF_UFLIA logic in the Incremental Track.

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

Benchmarks: 386
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 48862485744.80685728.96593067 0
2020-z3n 0 48823085369.55685353.732632467 0
MathSATn 0 485973117016.092116996.636858195 0
Yices2 0 48451290954.81590941.2521004271 0
smtinterpol 0 484118117873.049115834.6191043691 0
cvc5 0 372893112009.61112008.28312166187 0
OpenSMT 0 22173119971.106119913.88147238195 0

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