DivisibilityTask

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

val age: Int

def apply(goal: Goal, ptf: ProofTreeFactory): ProofTree

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def constructWrappedTask(reducedFormula: Conjunction, goal: Goal): Seq[FormulaTask]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

val formula: Conjunction

final def getClass(): Class[_]

def hashCode(): Int

def isCoveredFormula(f: Conjunction): Boolean

Return true if f is a formula that can be handled by this task

final def isInstanceOf[T0]: Boolean

val name: String

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val priority: Int

def splittingNecessary(goal: Goal): Boolean

Determine whether this formula requires real splitting, or whether it can be passed to the constraint unchanged

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

def updateFormula(f: Conjunction, goal: Goal): FormulaTask

Create a new FormulaTask by updating the value of formula

def updateTask(goal: Goal, factCollector: (Conjunction) ⇒ Unit): Seq[FormulaTask]

Update the task with possibly new information from the goal

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit