# UninterpretedSortTheory

### Related Docs: object UninterpretedSortTheory | package types

#### class UninterpretedSortTheory extends Theory

Theory to handle an uninterpreted sort. To ensure correct semantics, (non-empty, but cardinality might be finite or infinite), each uninterpreted sort is associated to a domain predicate, and an axiom specifying inhabitation is added.

Linear Supertypes
Theory, AnyRef, Any
Ordering
1. Alphabetic
2. By inheritance
Inherited
1. UninterpretedSortTheory
2. Theory
3. AnyRef
4. Any
1. Hide All
2. Show all
Visibility
1. Public
2. All

### Value Members

1. #### final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
2. #### final def ##(): Int

Definition Classes
AnyRef → Any
3. #### final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
4. #### final def asInstanceOf[T0]: T0

Definition Classes
Any
5. #### val axioms: Conjunction

Axioms defining the theory; such axioms are simply added as formulae to the problem to be proven, and thus handled using the standard reasoning techniques (including e-matching).

Axioms defining the theory; such axioms are simply added as formulae to the problem to be proven, and thus handled using the standard reasoning techniques (including e-matching).

Definition Classes
UninterpretedSortTheoryTheory
6. #### def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
7. #### val dependencies: Iterable[Theory]

Optionally, other theories that this theory depends on.

Optionally, other theories that this theory depends on. Specified dependencies will be loaded before this theory, but the preprocessors of the dependencies will be called after the preprocessor of this theory.

Definition Classes
Theory

9. #### final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
10. #### def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
11. #### def evalFun(f: IFunApp): Option[ITerm]

Optionally, a function evaluating theory functions applied to concrete arguments, represented as constructor terms.

Optionally, a function evaluating theory functions applied to concrete arguments, represented as constructor terms.

Definition Classes
Theory
12. #### def evalPred(p: IAtom): Option[Boolean]

Optionally, a function evaluating theory predicates applied to concrete arguments, represented as constructor terms.

Optionally, a function evaluating theory predicates applied to concrete arguments, represented as constructor terms.

Definition Classes
Theory
13. #### def extend(order: TermOrder): TermOrder

Add the symbols defined by this theory to the `order`

Add the symbols defined by this theory to the `order`

Definition Classes
Theory
14. #### def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
15. #### val functionPredicateMapping: List[Nothing]

Mapping of interpreted functions to interpreted predicates, used translating input ASTs to internal ASTs (the latter only containing predicates).

Mapping of interpreted functions to interpreted predicates, used translating input ASTs to internal ASTs (the latter only containing predicates).

Definition Classes
UninterpretedSortTheoryTheory
16. #### val functionalPredicates: Set[Predicate]

Information which of the predicates satisfy the functionality axiom; at some internal points, such predicates can be handled more efficiently

Information which of the predicates satisfy the functionality axiom; at some internal points, such predicates can be handled more efficiently

Definition Classes
UninterpretedSortTheoryTheory
17. #### val functions: List[Nothing]

Interpreted functions of the theory

Interpreted functions of the theory

Definition Classes
UninterpretedSortTheoryTheory
18. #### def generateDecoderData(model: Conjunction): Option[TheoryDecoderData]

If this theory defines any `Theory.Decoder`, which can translate model data into some theory-specific representation, this function can be overridden to pre-compute required data from a model.

If this theory defines any `Theory.Decoder`, which can translate model data into some theory-specific representation, this function can be overridden to pre-compute required data from a model.

Definition Classes
Theory
19. #### final def getClass(): Class[_]

Definition Classes
AnyRef → Any
20. #### def hashCode(): Int

Definition Classes
AnyRef → Any
21. #### def iPostprocess(f: IFormula, signature: Signature): IFormula

In the post-processing we eliminate domain predicates again, and if necessary add types of quantifiers.

In the post-processing we eliminate domain predicates again, and if necessary add types of quantifiers.

Definition Classes
UninterpretedSortTheoryTheory
22. #### def iPreprocess(f: IFormula, signature: Signature): (IFormula, Signature)

Optionally, a pre-processor that is applied to formulas over this theory, prior to sending the formula to a prover.

Optionally, a pre-processor that is applied to formulas over this theory, prior to sending the formula to a prover. This method will be applied very early in the translation process.

Definition Classes
Theory
23. #### final def isInstanceOf[T0]: Boolean

Definition Classes
Any
24. #### def isSoundForSat(theories: Seq[Theory], config: theories.Theory.SatSoundnessConfig.Value): Boolean

Check whether we can tell that the given combination of theories is sound for checking satisfiability of a problem, i.e., if proof construction ends up in a dead end, can it be concluded that a problem is satisfiable.

Check whether we can tell that the given combination of theories is sound for checking satisfiability of a problem, i.e., if proof construction ends up in a dead end, can it be concluded that a problem is satisfiable.

Definition Classes
UninterpretedSortTheoryTheory
25. #### val modelGenPredicates: Set[Predicate]

Optionally, a set of predicates used by the theory to tell the `PresburgerModelFinder` about terms that will be handled exclusively by this theory.

Optionally, a set of predicates used by the theory to tell the `PresburgerModelFinder` about terms that will be handled exclusively by this theory. If a proof goal in model generation mode contains an atom `p(x)`, for `p` in this set, then the `PresburgerModelFinder` will ignore `x` when assigning concrete values to symbols.

Definition Classes
Theory
26. #### final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
27. #### final def notify(): Unit

Definition Classes
AnyRef
28. #### final def notifyAll(): Unit

Definition Classes
AnyRef
29. #### def plugin: None.type

Optionally, a plug-in implementing reasoning in this theory

Optionally, a plug-in implementing reasoning in this theory

Definition Classes
UninterpretedSortTheoryTheory
30. #### def postSimplifiers: Seq[(IExpression) ⇒ IExpression]

Optionally, simplifiers that are applied to formulas output by the prover, for instance to interpolants or the result of quantifier.

Optionally, simplifiers that are applied to formulas output by the prover, for instance to interpolants or the result of quantifier. Such simplifiers are invoked by with `ap.parser.Simplifier`.

Definition Classes
Theory
31. #### def postprocess(f: Conjunction, order: TermOrder): Conjunction

Optionally, a post-processor that is applied to formulas output by the prover, for instance to interpolants or the result of quantifier elimination.

Optionally, a post-processor that is applied to formulas output by the prover, for instance to interpolants or the result of quantifier elimination. This method will be applied to the raw formulas, before calling `Internal2Inputabsy`.

Definition Classes
Theory
32. #### val predicateMatchConfig: PredicateMatchConfig

Information how interpreted predicates should be handled for e-matching.

Information how interpreted predicates should be handled for e-matching.

Definition Classes
UninterpretedSortTheoryTheory
33. #### val predicates: List[Predicate]

Interpreted predicates of the theory

Interpreted predicates of the theory

Definition Classes
UninterpretedSortTheoryTheory
34. #### def preprocess(f: Conjunction, order: TermOrder): Conjunction

Optionally, a pre-processor that is applied to formulas over this theory, prior to sending the formula to a prover.

Optionally, a pre-processor that is applied to formulas over this theory, prior to sending the formula to a prover.

Definition Classes
Theory
35. #### val reducerPlugin: ReducerPluginFactory

Optionally, a plugin for the reducer applied to formulas both before and during proving.

Optionally, a plugin for the reducer applied to formulas both before and during proving.

Definition Classes
Theory
36. #### val singleInstantiationPredicates: Set[Predicate]

When instantiating existentially quantifier formulas, `EX phi`, at most one instantiation is necessary provided that all predicates in `phi` are contained in this set.

When instantiating existentially quantifier formulas, `EX phi`, at most one instantiation is necessary provided that all predicates in `phi` are contained in this set.

Definition Classes
Theory

38. #### final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
39. #### def toString(): String

Definition Classes
UninterpretedSortTheory → AnyRef → Any
40. #### val totalityAxioms: Conjunction

Additional axioms that are included if the option `+genTotalityAxioms` is given to Princess.

Additional axioms that are included if the option `+genTotalityAxioms` is given to Princess.

Definition Classes
UninterpretedSortTheoryTheory
41. #### val triggerRelevantFunctions: Set[IFunction]

A list of functions that should be considered in automatic trigger generation

A list of functions that should be considered in automatic trigger generation

Definition Classes
UninterpretedSortTheoryTheory
42. #### final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
43. #### final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
44. #### final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )