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

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

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

Benchmarks: 300
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 299 3369.027 2235.57611 0
cvc5-lfsc 0 261 47581.774 47576.8633939 0
veriT 0 246 115.018 105.324540 0
cvc5 0 20 330219.289 330211.007280272 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
smtinterpol 0 2993369.0272235.57611 0
cvc5-lfsc 0 26147582.71447576.4733939 0
veriT 0 246115.018105.324540 0
cvc5 0 20330250.889330199.207280272 0

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