Formulae that the proof assumes to be present on this branch (i.e., premisses of rules applied in the proof).
Formulae that the proof assumes to be present on this branch (i.e., premisses of rules applied in the proof). We assume that all formulae live in the antecedent.
The constraint resulting from this proof
The constraint resulting from this proof
Set of constants occurring in this certificate.
Set of constants occurring in this certificate. By default this will contain the set of all constants in sub-certificates, as well as constants in assumed formulas.
Constants bound by the root operator of the certificate.
Constants bound by the root operator of the certificate.
Formulae that are introduced into the antecedent by this rule application (one set for each subproof).
Formulae that are introduced into the antecedent by this rule application (one set for each subproof). This will implicitly simplify formulae (all simplifications that are built into the datastructures are carried out).
(Since version ) see corresponding Javadoc for more information.
Certificate corresponding to an application of the Omega rule, which has the same effect as repeated application of Strengthen to the inequalities
boundsA
in a goal.For each of the inequalities in
boundsA
,strengthenCases
tells how often Strengthen is applied. The counting works just like inStrengthenCertificate
, i.e.,1
means that Strenghten is applied once (and there are two cases).