In computer science and mathematical logic, satisfiability modulo theories is the problem of determining whether a mathematical formula is satisfiable. Wikipedia