A constraint is considered valid if the formula
\forall universalConstants; \exists existentialConstants; constraint
is valid
A constraint is considered valid if the formula
\forall universalConstants; \exists existentialConstants; constraint
is valid
(Since version ) see corresponding Javadoc for more information.
A prover that tries to construct an exhaustive proof for a given goal. The prover tries to optimise by early stopping the expansion of the proof tree if it is detected that a certain subtree can never yield a satisfiable closing constraint. There are two main modes of operation: with
depthFirst
, it is tried to derive a satisfiable constraint from the given problem, without aiming for exhaustiveness. Without this option, the tree is expanded depth-first until it is exhaustive (which terminates in the case of PA formulae, but not in general).