query_backend
Run a TPTP problem through any AtpClient backend and return the normalized SZS verdict (Theorem, Unsatisfiable, Satisfiable, etc.) for automated theorem proving.
Instructions
Run a TPTP-format problem through any AtpClient backend and return the
normalised SZS Ontology verdict (Theorem, Unsatisfiable, Satisfiable,
CounterSatisfiable, GaveUp, Timeout, ResourceOut, …). The unified
AtpClient.Backend.query/2 entry point — each backend hides its
ceremony (session, prover selection, theory bookkeeping) behind this
call. Call describe_szs for the full ontology.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| raw | No | Return the system's verbatim output instead of the SZS verdict | |
| backend | Yes | Which backend to run on | |
| problem | Yes | TPTP problem text | |
| time_limit_sec | No | Time limit for backends that honour it (sotptp) |