Over a theory of arrays of arrays of integer index and real value.Ĭlosed linear formulas over linear integer arithmetic.Ĭlosed linear formulas in linear real arithmetic.Ĭlosed quantifier-free formulas over the theory of bitvectors and bitvector arrays.Ĭlosed quantifier-free formulas over the theory of bitvectors and bitvector arrays extended with free sort and function symbols.Ĭlosed quantifier-free linear formulas over the theory of integer arraysĮxtended with free sort and function symbols.Ĭlosed quantifier-free formulas over the theory of arrays with extensionality.Ĭlosed quantifier-free formulas over the theory of fixed-size bitvectors.īoolean combinations of inequations of the form x - y < b Over one- and two-dimentional arrays of integer index and real value.Ĭlosed formulas with free function and predicate symbols
More will be added later.Ĭlosed formulas over the theory of linear integer arithmetic and arraysĮxtended with free sort and function symbolsīut restricted to arrays with integer indices and values.Ĭlosed linear formulas with free sort and function symbols Note:The listing below is currently incomplete.
#Sort idl full#
One consequence of this is that we do not haveĪ logic such as RA here, for instance, since an RA benchmark belongs to either LRA or NRA.Ĭlick on the logic's name for a full description. This is why, for instance, QF_AX is not a sublogic of QF_AUFLIA or QF_ABV.įinally, benchmarks are typically classified by the smallest logic they belong to. For instance, in the *A*LIA logics the only array sort allowed is (Array Int Int), whereas in some A*IRA logics the only array sort allowed are (Array Int Real) and (Array Int (Array Int Real)). The reason for this, admittedly idiosyncratic, nomenclature is mostly historical.Īlso historical is the fact that some logics impose further restrictions on the language.