Description
Satisfiability Modulo Theories problems can be solved with an automatic theorem prover. This is useful for formal verification, symbolic reasoning, program analysis, and research workflows.
It is a mathematical and verification tool for users who understand SMT inputs. Solver results depend on the model, logic, assumptions, and timeout settings.