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

AUFLIA (Proof Exhibition Track)

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

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

Benchmarks: 1296
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 1174 141716.345 141745.366122105 3
cvc5-lfsc 0 1169 159000.895 159056.013127127 0
cvc5 0 1169 159152.822 159156.884127127 0
smtinterpol 0 1040 318176.363 304296.727256230 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
veriT 0 1174141748.735141739.636122105 3
cvc5-lfsc 0 1169159048.675159049.673127127 0
cvc5 0 1169159203.582159149.804127127 0
smtinterpol 0 1040336887.843300499.219256219 0

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