public class QuantifiedFormula extends Term
(forall ((var_1 sort_1) ... (var_n sort_n)) ...)or
(exists ((var_1 sort_1) ... (var_n sort_n)) ...). A quantified formula is created by
Script.quantifier(int, TermVariable[], Term, Term[][])
.Modifier and Type | Method and Description |
---|---|
int |
getQuantifier() |
Sort |
getSort()
Returns the SMTLIB sort of this term.
|
Term |
getSubformula()
Get the formula under the quantifier.
|
TermVariable[] |
getVariables()
Get the quantified variables.
|
int |
hashCode() |
static int |
hashQuantifier(int quant,
TermVariable[] vars,
Term f) |
void |
toStringHelper(java.util.ArrayDeque<java.lang.Object> mTodo)
Convert a term to a string in a stack based fashion.
|
getFreeVars, getTheory, toString, toStringDirect
public static final int EXISTS
public static final int FORALL
public int getQuantifier()
public TermVariable[] getVariables()
public Term getSubformula()
public Sort getSort()
Term
public static final int hashQuantifier(int quant, TermVariable[] vars, Term f)
public void toStringHelper(java.util.ArrayDeque<java.lang.Object> mTodo)
Term
toStringHelper
in class Term
mTodo
- The stack where to put the strings and sub terms.PrintTerm