SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions

SMT-COMP 2021

Rules
Benchmarks
Tools
Specs
Parallel & Cloud Tracks
Participants
Results
Slides

QF_NIA (Parallel Track)

Competition results for the QF_NIA logic in the Parallel Track.

Page generated on 2021-07-18 17:32:11 +0000

Benchmarks: 17
Time Limit: 1200 seconds
Memory Limit: N/A GB

This track is experimental. Solvers are only ranked by performance, but no winner is selected.

Parallel Performance

Solver Error Score Correct ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedTimeout Memout
Par4n 0 614439.0116511111 0
cvc5-gg 0 116850.6391101614 0

SAT Performance

Solver Error Score Correct ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedN/ATimeout Memout
Par4n 0 57231.7715505711 0
cvc5-gg 0 110850.6391109714 0

UNSAT Performance

Solver Error Score Correct ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedN/ATimeout Memout
Par4n 0 11207.2410111511 0
cvc5-gg 0 01200.000021514 0

24 seconds Performance

Solver Error Score Correct ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedTimeout Memout
Par4n 0 3348.7773211414 0
cvc5-gg 0 0360.00001715 0

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