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

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

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

Benchmarks: 113
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
veriT 0 109 13494.704 13391.84945 0
smtinterpol 0 79 47098.992 45210.3493434 0
cvc5-lfsc 0 64 67253.959 67268.2864949 0
cvc5 0 8 124542.43 124555.341105103 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
veriT 0 10913497.42413374.00944 0
smtinterpol 0 7947098.99245210.3493434 0
cvc5-lfsc 0 6467267.01967266.3064949 0
cvc5 0 8124567.01124549.641105103 0

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