SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions

SMT-COMP 2023

Rules
Benchmarks
Specs
Model Validation Track
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 2023-07-06 16:06:18 +0000

Benchmarks: 176
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 167 241.4 240.27399 0
cvc5 0 149 548.387 542.9532722 0
SMTInterpol 0 58 109.322 57.0331180 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
cvc5-lfsc 0 167241.4240.27399 0
cvc5 0 149548.387542.9532722 0
SMTInterpol 0 58109.32257.0331180 0

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