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_NRA (Parallel Track)

Competition results for the QF_NRA 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 716436.7047521010 0
cvc5-gg 0 27242.755211156 0

SAT Performance

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

UNSAT Performance

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

24 seconds Performance

Solver Error Score Correct ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedTimeout Memout
cvc5-gg 0 1170.471110167 0
Par4n 0 1387.1221101616 0

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