Ground Theorem Proving is a formal method in automated reasoning that, within the context of Satisfiability Modulo Theories, refers to the process of proving the validity of quantifier-free (ground) logical formulas with respect to a combination of background theories by leveraging decision procedures and inference rules specific to those theories.