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

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

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

Benchmarks: 380
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 380 1005.865 409.38500 0
cvc5-lfsc 0 363 28232.302 28229.3451717 0
cvc5 0 219 191018.194 190976.898161157 0
veriT 0 131 16.876 14.6162490 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
smtinterpol 0 3801005.865409.38500 0
cvc5-lfsc 0 36328233.77228228.8151717 0
cvc5 0 219191037.564190970.028161157 0
veriT 0 13116.87614.6162490 0

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