Interactive interface to an interactive prover like an SMT solver.
Interactive interface to an interactive prover like an SMT solver.
The methods on this trait are chosen for similarity to the SMT-LIB standard. You can imagine that an instance of this trait is a single SMT solver processing commands interactively.
A prover that is able to refute HOL sequents/formulas (or subsets of HOL, like propositional logic).
A prover that is able to refute HOL sequents/formulas (or subsets of HOL, like propositional logic).
TODO: exceptions to indicate that a formula is not supported (e.g. for propositional provers).
Implementors may want to override isValid(seq) to avoid parsing proofs.