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

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

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

Benchmarks: 196
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 191 6063.191 6064.28755 0
cvc5 0 180 15862.237 15819.7631611 0
smtinterpol 0 65 133.871 72.041310 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
cvc5-lfsc 0 1916065.1216064.09755 0
cvc5 0 18015864.57715819.2031611 0
smtinterpol 0 65133.87172.041310 0

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