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_LIA (Proof Exhibition Track)

Competition results for the QF_LIA logic in the Proof Exhibition Track.

Page generated on 2022-08-10 11:19:33 +0000

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

This track is experimental. Solvers are only ranked by performance, but no winner is selected.

Sequential Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreUnsolvedTimeout Memout
smtinterpol 0 2240 397331.778 335847.351137145 0
OpenSMT 0 2023 229537.564 229128.36235468 0
veriT 0 1435 1048658.86 1048554.946942815 1
cvc5-lfsc 0 1275 1348873.712 1349211.25411021094 0
cvc5 0 854 1807708.42 1807983.92315231490 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
smtinterpol 0 2240415744.148332486.128137126 0
OpenSMT 0 2023229554.504229126.08235468 0
veriT 0 14351048726.571048524.166942815 1
cvc5-lfsc 0 12751349252.4621349151.78411021094 0
cvc5 0 8541808152.891807901.38315231489 0

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