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

AUFLIRA (Proof Exhibition Track)

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

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

Benchmarks: 9888
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
cvc5-lfsc 0 9849 58453.907 58432.1723939 0
cvc5 0 9805 96615.874 96491.4158377 0
veriT 0 9660 266387.593 266337.18228221 0
smtinterpol 0 9536 373877.259 365209.916352296 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
cvc5-lfsc 0 984958460.82758430.8823939 0
cvc5 0 980596631.43496487.1558377 0
veriT 0 9660266402.983266330.08228221 0
smtinterpol 0 9536389416.149363396.801352288 0

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