SMT-COMP 2019

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Papers
Benchmark Submission
Rules
Benchmarks
Tools
Specs
Participants
Results
Slides

Previous Competitions

SMT-LIB

Par4

Competing yes
Single Query Track AUFLIRA, AUFNIRA, BV, LRA, NRA, QF_ABV, QF_BV, QF_BVFP, QF_FP, QF_IDL, QF_LIA, QF_LIRA, QF_LRA, QF_NIA, QF_NRA, QF_UF, QF_UFNRA, UF, UFBV, UFIDL, UFLIA, UFNIA
Incremental Track
Challenge Track (non-incremental)
Challenge Track (incremental)
Unsat Core Track
Model Validation Track (experimental)
Preliminary ID 23391
Final ID 23672
Seed 0
System Description Par4
Variant of Submission ID
Derived from Solver
Wrapped Solvers AProVE (smt-comp 2018), Boolector (smt-comp 2018), COLIBRI (smt-comp 2018), CVC4 (smt-comp 2018), SMTInterpol (smt-comp 2018), SMTRAT (smt-comp 2018), veriT (smt-comp 2018), Yices (smt-comp 2018), Z3 (smt-comp 2018)
Website
Team Members Tjark Weber
Contact tjark.weber@it.uu.se