For typical first-order logical theories, satisfying assignments have a straightforward finite representation that can directly serve as a certificate that a given assignment satisfies the given formula. For non-linear real arithmetic augmented with trigonometric and exponential functions ( \(\mathcal {N\hspace{-0.55542pt}T\hspace{-2.22214pt}A}\) ), however, there is no known direct representation of satisfying assignments that allows for a simple independent check of whether the represented numbers exist and satisfy the given formula. Hence, in this paper, we introduce a different form of satisfiability certificate for \(\mathcal {N\hspace{-0.55542pt}T\hspace{-2.22214pt}A}\) , and formulate the satisfiability problem as the problem of searching for such a certificate. This does not only ease the independent verification of satisfiability, but also allows the design of new algorithms that show satisfiability by systematically searching for such certificates. Computational experiments document that the resulting algorithms are able to prove satisfiability of a substantially higher number of benchmark problems than existing methods. We also characterize the formulas whose satisfiability can be demonstrated by such a certificate, by providing lower and upper bounds in terms of relevant well-known classes. Finally we show the existence of a procedure for checking the satisfiability of \(\mathcal {N\hspace{-0.55542pt}T\hspace{-2.22214pt}A}\) -formulas that terminates for formulas that satisfy certain robustness assumptions.
