class Goal extends ProofTree
- Alphabetic
- By Inheritance
- Goal
- ProofTree
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def addTasksFor(fors: Iterable[Conjunction]): (Goal, Seq[CertFormula])
Generate tasks for the given formulas and add them to the goal
- val age: Int
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def bindingContext: BindingContext
- Definition Classes
- ProofTree
- val branchInferences: BranchInferenceCollection
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @HotSpotIntrinsicCandidate() @native()
- lazy val closingConstantFreedom: ConstantFreedom
The constants that can be considered free (resp., that have to be considered non-free) in this proof tree.
- lazy val closingConstraint: Conjunction
The fully simplified closing constraint
- val compoundFormulas: CompoundFormulas
- def constantFreedom: ConstantFreedom
- Definition Classes
- ProofTree
- lazy val constants: Set[ConstantTerm]
All constants that occur in formulas in this goal
- val definedSyms: Substitution
- val eliminatedConstants: Set[ConstantTerm]
- lazy val eliminatedIsolatedConstants: Set[ConstantTerm]
Constants that can be eliminated in this goal because they are universal, and they do not occur in any tasks or compound formulas (but they might occur in the facts)
- def eliminates(t: Term): Boolean
Return whether
t
is a constant that is eliminated in this goal - final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- val facts: Conjunction
- def filterTasks(p: (PrioritisedTask) => Boolean): Goal
Eliminate all prioritised tasks for which the given predicate is false.
- lazy val fixedConstantFreedom: Boolean
true
if the sets of free constants have reached a fixed point - def formulaTasks(formula: Conjunction): Seq[FormulaTask]
Create the tasks to store and handle an arbitrary given formula.
Create the tasks to store and handle an arbitrary given formula. This method is part of the goal because different tasks might be created depending on the settings
- def getCertificate: Certificate
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- def getInferenceCollector: BranchInferenceCollector
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- lazy val mayAlias: AliasChecker
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- def order: TermOrder
- Definition Classes
- ProofTree
- lazy val reduceWithFacts: ReduceWithConjunction
- lazy val reducerSettings: Value
- val settings: GoalSettings
- def startNewInferenceCollection: BranchInferenceCollection
- def startNewInferenceCollection(initialFors: => Iterable[Conjunction]): BranchInferenceCollection
Function to be called after split rules, to generate new inference collections for the subgoals.
Function to be called after split rules, to generate new inference collections for the subgoals. All compound formulae introduced by the split rule (formulae that are not literals) have to be given as arguments.
- def startNewInferenceCollectionCert(initialFors: => Iterable[CertFormula]): BranchInferenceCollection
- def step(ptf: ProofTreeFactory): ProofTree
- val stepMeaningful: Boolean
true
if there are chances that theclosingConstraint
of this tree changes by applying rules to any goal - val stepPossible: Boolean
true
if it is possible to apply rules to any goal in this tree - val subtrees: Seq[ProofTree]
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- val tasks: TaskManager
- def toString(): String
- Definition Classes
- Goal → AnyRef → Any
- def updateConstantFreedom(cf: ConstantFreedom): Goal
- val vocabulary: Vocabulary
the vocabulary available at a certain node in the proof
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
(Since version 9)