The International Satisfiability Modulo Theories (SMT) Competition.
    Home
    Introduction
    Benchmark Submission
    Publications
    SMT-LIB
    Previous Editions
  
| Competing | yes | 
| Single Query Track | |
| Incremental Track | |
| Unsat Core Track | |
| Model Validation Track | |
| Proof Exhibition Track | |
| Cloud Track | QF_UFLRA, QF_UFLIA, QF_LRA, QF_LIA, QF_UF, QF_IDL, QF_RDL | 
| Parallel Track | QF_UFLRA, QF_UFLIA, QF_LRA, QF_LIA, QF_UF, QF_IDL, QF_RDL | 
| Preliminary ID | |
| Final ID | 1 | 
| Seed | |
| System Description | |
| Variant of Submission ID | |
| Derived from Solver | |
| Wrapped Solvers | |
| Website | https://github.com/usi-verification-and-security/SMTS/tree/cube-and-conquer | 
| Team Members | Seyedmasoud Asadzadeh, Antti Hyvärinen, Martin Blicha, Konstantin Britikov, Sepideh Asadi, Matteo Marescotti, Václav Luňák, Leonardo Alt, Mate Soos, Natasha Sharygina |