An SMT solver for the QF_UF (Quantifier-Free Uninterpreted Functions) logic, implementing DPLL(T) with a congruence closure theory solver (Nieuwenhuis–Oliveras 2007) and CaDiCaL 3.x as the SAT backend ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results