Resolution-style theorem prover
otter < input-file > output-file
This manual page documents briefly the otter command.
otter is a resolution-style theorem-proving program for first-order logic with equality. otter includes the inference rules binary resolution, hyperresolution, UR-resolution, and binary paramodulation. Some of its other abilities and features are conversion from first-order formulas to clauses, forward and back subsumption, factoring, weighting, answer literals, term ordering, forward and back demodulation, evaluable functions and predicates, Knuth-Bendix completion, and the hints strategy.
No command-line options are accepted; all options are given in the input file.
otter ws written by William McCune <[email protected]>
This manual page was written by Peter Collingbourne <[email protected]>, for the Debian project (but may be used by others).