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

LIA (Incremental Track)

Competition results for the LIA logic in the Incremental Track.

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

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

Winners

Parallel Performance
cvc5

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
z3-4.8.17n 0 253939.1818.25700 0
2021-cvc5-incn 0 2539322.61121.32400 0
cvc5 0 2539350.38448.96200 0
UltimateEliminator+MathSAT 0 25393219.588120.13800 0
smtinterpol 0 25391108.13332.63320 0

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