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_UFNRA (Incremental Track)

Competition results for the QF_UFNRA logic in the Incremental Track.

Page generated on 2022-08-10 11:18:22 +0000

Benchmarks: 1
Time Limit: 1200 seconds
Memory Limit: 60 GB

Winners

Parallel Performance
cvc5

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
2021-z3n 0 60.0330.03100 0
z3-4.8.17n 0 60.0330.03200 0
cvc5 0 60.0540.05200 0
smtinterpol 0 60.6970.42700 0
MathSATn 0 00.0050.0260 0

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