FindProof -- equational theorem prover (CASC UEQ entry).

BUILD
  make                 # produces bin/FindProof  (needs a C11 compiler + libm)
  ./starexec_build     # equivalent, for StarExec

The whole engine is one self-contained translation unit; no external
dependencies beyond the C standard library and libm.

STAREXEC CONFIGURATION
  bin/starexec_run_default PROBLEM.p
      CASC UEQ proving.  Reads the wall-clock limit from
      $STAREXEC_WALLCLOCK_LIMIT (default 120s), runs a CONCURRENT
      portfolio (a pool of 5 configuration slices, each with the full
      wall; first proof wins), and writes an SZS status line plus, on
      success, an SZS CNFRefutation.

RUN (manual)
  bin/FindProof --schedule --szs --proof --wall=120 PROBLEM.p   # portfolio
  bin/FindProof --szs PROBLEM.p                                 # single config
  bin/FindProof --list-knobs                                    # strategy surface

INPUT   TPTP CNF unit-equality problems.  include('Axioms/*.ax') directives
        resolve against the problem directory and $TPTP.
OUTPUT  SZS status (Unsatisfiable / Satisfiable / GaveUp / ResourceOut /
        Timeout) and, with --proof, an SZS CNFRefutation.

The companion ProoVer entry, CheckProof (a first-order TSTP proof
checker built from the same sources), ships as its own tarball; see
tools/proover/ in the source repository.
