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

Competition results for the QF_NIA logic in the Incremental Track.

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

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

Winners

Parallel Performance
smtinterpol

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
2021-MathSAT5n 0 41816571721.7551473.87300 0
MathSATn 0 41816571791.9741544.84600 0
z3-4.8.17n 0 41816572325.6882105.81900 0
smtinterpol 0 41816574117.5363176.73800 0
cvc5 0 168001611561.72611547.69625016419 0
Yices2 0 20495112000.012000.0397670610 0

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