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

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

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

Benchmarks: 183
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 183 1392.832 803.09700 0
cvc5-lfsc 0 182 4007.791 4005.87310 0
veriT 0 180 6517.743 6514.94833 0
cvc5 0 94 106214.691 106176.6768988 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
smtinterpol 0 1831392.832803.09700 0
cvc5-lfsc 0 1824007.7914005.87310 0
veriT 0 1806518.1036514.77833 0
cvc5 0 94106227.441106172.7468988 0

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