Z3
 
Loading...
Searching...
No Matches
Public Member Functions | Data Fields
Goal Class Reference
+ Inheritance diagram for Goal:

Public Member Functions

def __init__ (self, models=True, unsat_cores=False, proofs=False, ctx=None, goal=None)
 
def __del__ (self)
 
def depth (self)
 
def inconsistent (self)
 
def prec (self)
 
def precision (self)
 
def size (self)
 
def __len__ (self)
 
def get (self, i)
 
def __getitem__ (self, arg)
 
def assert_exprs (self, *args)
 
def append (self, *args)
 
def insert (self, *args)
 
def add (self, *args)
 
def convert_model (self, model)
 
def __repr__ (self)
 
def sexpr (self)
 
def dimacs (self, include_names=True)
 
def translate (self, target)
 
def __copy__ (self)
 
def __deepcopy__ (self, memo={})
 
def simplify (self, *arguments, **keywords)
 
def as_expr (self)
 
- Public Member Functions inherited from Z3PPObject
def use_pp (self)
 

Data Fields

 ctx
 
 goal
 

Additional Inherited Members

- Protected Member Functions inherited from Z3PPObject
def _repr_html_ (self)
 

Detailed Description

Goal is a collection of constraints we want to find a solution or show to be unsatisfiable (infeasible).

Goals are processed using Tactics. A Tactic transforms a goal into a set of subgoals.
A goal has a solution if one of its subgoals has a solution.
A goal is unsatisfiable if all subgoals are unsatisfiable.

Definition at line 5547 of file z3py.py.

Constructor & Destructor Documentation

◆ __init__()

def __init__ (   self,
  models = True,
  unsat_cores = False,
  proofs = False,
  ctx = None,
  goal = None 
)

Definition at line 5555 of file z3py.py.

5555 def __init__(self, models=True, unsat_cores=False, proofs=False, ctx=None, goal=None):
5556 if z3_debug():
5557 _z3_assert(goal is None or ctx is not None,
5558 "If goal is different from None, then ctx must be also different from None")
5559 self.ctx = _get_ctx(ctx)
5560 self.goal = goal
5561 if self.goal is None:
5562 self.goal = Z3_mk_goal(self.ctx.ref(), models, unsat_cores, proofs)
5563 Z3_goal_inc_ref(self.ctx.ref(), self.goal)
5564
void Z3_API Z3_goal_inc_ref(Z3_context c, Z3_goal g)
Increment the reference counter of the given goal.
Z3_goal Z3_API Z3_mk_goal(Z3_context c, bool models, bool unsat_cores, bool proofs)
Create a goal (aka problem). A goal is essentially a set of formulas, that can be solved and/or trans...

◆ __del__()

def __del__ (   self)

Definition at line 5565 of file z3py.py.

5565 def __del__(self):
5566 if self.goal is not None and self.ctx.ref() is not None and Z3_goal_dec_ref is not None:
5567 Z3_goal_dec_ref(self.ctx.ref(), self.goal)
5568
void Z3_API Z3_goal_dec_ref(Z3_context c, Z3_goal g)
Decrement the reference counter of the given goal.

Member Function Documentation

◆ __copy__()

def __copy__ (   self)

Definition at line 5800 of file z3py.py.

5800 def __copy__(self):
5801 return self.translate(self.ctx)
5802

◆ __deepcopy__()

def __deepcopy__ (   self,
  memo = {} 
)

Definition at line 5803 of file z3py.py.

5803 def __deepcopy__(self, memo={}):
5804 return self.translate(self.ctx)
5805

◆ __getitem__()

def __getitem__ (   self,
  arg 
)
Return a constraint in the goal `self`.

>>> g = Goal()
>>> x, y = Ints('x y')
>>> g.add(x == 0, y > x)
>>> g[0]
x == 0
>>> g[1]
y > x

Definition at line 5674 of file z3py.py.

5674 def __getitem__(self, arg):
5675 """Return a constraint in the goal `self`.
5676
5677 >>> g = Goal()
5678 >>> x, y = Ints('x y')
5679 >>> g.add(x == 0, y > x)
5680 >>> g[0]
5681 x == 0
5682 >>> g[1]
5683 y > x
5684 """
5685 if arg >= len(self):
5686 raise IndexError
5687 return self.get(arg)
5688

◆ __len__()

def __len__ (   self)
Return the number of constraints in the goal `self`.

>>> g = Goal()
>>> len(g)
0
>>> x, y = Ints('x y')
>>> g.add(x == 0, y > x)
>>> len(g)
2

Definition at line 5648 of file z3py.py.

5648 def __len__(self):
5649 """Return the number of constraints in the goal `self`.
5650
5651 >>> g = Goal()
5652 >>> len(g)
5653 0
5654 >>> x, y = Ints('x y')
5655 >>> g.add(x == 0, y > x)
5656 >>> len(g)
5657 2
5658 """
5659 return self.size()
5660

Referenced by AstVector.__getitem__(), and AstVector.__setitem__().

◆ __repr__()

def __repr__ (   self)

Definition at line 5766 of file z3py.py.

5766 def __repr__(self):
5767 return obj_to_string(self)
5768

◆ add()

def add (   self,
args 
)
Add constraints.

>>> x = Int('x')
>>> g = Goal()
>>> g.add(x > 0, x < 2)
>>> g
[x > 0, x < 2]

Definition at line 5726 of file z3py.py.

5726 def add(self, *args):
5727 """Add constraints.
5728
5729 >>> x = Int('x')
5730 >>> g = Goal()
5731 >>> g.add(x > 0, x < 2)
5732 >>> g
5733 [x > 0, x < 2]
5734 """
5735 self.assert_exprs(*args)
5736

Referenced by Solver.__iadd__(), Fixedpoint.__iadd__(), and Optimize.__iadd__().

◆ append()

def append (   self,
args 
)
Add constraints.

>>> x = Int('x')
>>> g = Goal()
>>> g.append(x > 0, x < 2)
>>> g
[x > 0, x < 2]

Definition at line 5704 of file z3py.py.

5704 def append(self, *args):
5705 """Add constraints.
5706
5707 >>> x = Int('x')
5708 >>> g = Goal()
5709 >>> g.append(x > 0, x < 2)
5710 >>> g
5711 [x > 0, x < 2]
5712 """
5713 self.assert_exprs(*args)
5714

◆ as_expr()

def as_expr (   self)
Return goal `self` as a single Z3 expression.

>>> x = Int('x')
>>> g = Goal()
>>> g.as_expr()
True
>>> g.add(x > 1)
>>> g.as_expr()
x > 1
>>> g.add(x < 10)
>>> g.as_expr()
And(x > 1, x < 10)

Definition at line 5826 of file z3py.py.

5826 def as_expr(self):
5827 """Return goal `self` as a single Z3 expression.
5828
5829 >>> x = Int('x')
5830 >>> g = Goal()
5831 >>> g.as_expr()
5832 True
5833 >>> g.add(x > 1)
5834 >>> g.as_expr()
5835 x > 1
5836 >>> g.add(x < 10)
5837 >>> g.as_expr()
5838 And(x > 1, x < 10)
5839 """
5840 sz = len(self)
5841 if sz == 0:
5842 return BoolVal(True, self.ctx)
5843 elif sz == 1:
5844 return self.get(0)
5845 else:
5846 return And([self.get(i) for i in range(len(self))], self.ctx)
5847

◆ assert_exprs()

def assert_exprs (   self,
args 
)
Assert constraints into the goal.

>>> x = Int('x')
>>> g = Goal()
>>> g.assert_exprs(x > 0, x < 2)
>>> g
[x > 0, x < 2]

Definition at line 5689 of file z3py.py.

5689 def assert_exprs(self, *args):
5690 """Assert constraints into the goal.
5691
5692 >>> x = Int('x')
5693 >>> g = Goal()
5694 >>> g.assert_exprs(x > 0, x < 2)
5695 >>> g
5696 [x > 0, x < 2]
5697 """
5698 args = _get_args(args)
5699 s = BoolSort(self.ctx)
5700 for arg in args:
5701 arg = s.cast(arg)
5702 Z3_goal_assert(self.ctx.ref(), self.goal, arg.as_ast())
5703
void Z3_API Z3_goal_assert(Z3_context c, Z3_goal g, Z3_ast a)
Add a new formula a to the given goal. The formula is split according to the following procedure that...

Referenced by Goal.add(), Solver.add(), Fixedpoint.add(), Optimize.add(), Goal.append(), Solver.append(), Fixedpoint.append(), Goal.insert(), Solver.insert(), and Fixedpoint.insert().

◆ convert_model()

def convert_model (   self,
  model 
)
Retrieve model from a satisfiable goal
>>> a, b = Ints('a b')
>>> g = Goal()
>>> g.add(Or(a == 0, a == 1), Or(b == 0, b == 1), a > b)
>>> t = Then(Tactic('split-clause'), Tactic('solve-eqs'))
>>> r = t(g)
>>> r[0]
[Or(b == 0, b == 1), Not(0 <= b)]
>>> r[1]
[Or(b == 0, b == 1), Not(1 <= b)]
>>> # Remark: the subgoal r[0] is unsatisfiable
>>> # Creating a solver for solving the second subgoal
>>> s = Solver()
>>> s.add(r[1])
>>> s.check()
sat
>>> s.model()
[b = 0]
>>> # Model s.model() does not assign a value to `a`
>>> # It is a model for subgoal `r[1]`, but not for goal `g`
>>> # The method convert_model creates a model for `g` from a model for `r[1]`.
>>> r[1].convert_model(s.model())
[b = 0, a = 1]

Definition at line 5737 of file z3py.py.

5737 def convert_model(self, model):
5738 """Retrieve model from a satisfiable goal
5739 >>> a, b = Ints('a b')
5740 >>> g = Goal()
5741 >>> g.add(Or(a == 0, a == 1), Or(b == 0, b == 1), a > b)
5742 >>> t = Then(Tactic('split-clause'), Tactic('solve-eqs'))
5743 >>> r = t(g)
5744 >>> r[0]
5745 [Or(b == 0, b == 1), Not(0 <= b)]
5746 >>> r[1]
5747 [Or(b == 0, b == 1), Not(1 <= b)]
5748 >>> # Remark: the subgoal r[0] is unsatisfiable
5749 >>> # Creating a solver for solving the second subgoal
5750 >>> s = Solver()
5751 >>> s.add(r[1])
5752 >>> s.check()
5753 sat
5754 >>> s.model()
5755 [b = 0]
5756 >>> # Model s.model() does not assign a value to `a`
5757 >>> # It is a model for subgoal `r[1]`, but not for goal `g`
5758 >>> # The method convert_model creates a model for `g` from a model for `r[1]`.
5759 >>> r[1].convert_model(s.model())
5760 [b = 0, a = 1]
5761 """
5762 if z3_debug():
5763 _z3_assert(isinstance(model, ModelRef), "Z3 Model expected")
5764 return ModelRef(Z3_goal_convert_model(self.ctx.ref(), self.goal, model.model), self.ctx)
5765
Z3_model Z3_API Z3_goal_convert_model(Z3_context c, Z3_goal g, Z3_model m)
Convert a model of the formulas of a goal to a model of an original goal. The model may be null,...

Referenced by Goal.convert_model().

◆ depth()

def depth (   self)
Return the depth of the goal `self`.
The depth corresponds to the number of tactics applied to `self`.

>>> x, y = Ints('x y')
>>> g = Goal()
>>> g.add(x == 0, y >= x + 1)
>>> g.depth()
0
>>> r = Then('simplify', 'solve-eqs')(g)
>>> # r has 1 subgoal
>>> len(r)
1
>>> r[0].depth()
2

Definition at line 5569 of file z3py.py.

5569 def depth(self):
5570 """Return the depth of the goal `self`.
5571 The depth corresponds to the number of tactics applied to `self`.
5572
5573 >>> x, y = Ints('x y')
5574 >>> g = Goal()
5575 >>> g.add(x == 0, y >= x + 1)
5576 >>> g.depth()
5577 0
5578 >>> r = Then('simplify', 'solve-eqs')(g)
5579 >>> # r has 1 subgoal
5580 >>> len(r)
5581 1
5582 >>> r[0].depth()
5583 2
5584 """
5585 return int(Z3_goal_depth(self.ctx.ref(), self.goal))
5586
unsigned Z3_API Z3_goal_depth(Z3_context c, Z3_goal g)
Return the depth of the given goal. It tracks how many transformations were applied to it.

Referenced by Goal.depth().

◆ dimacs()

def dimacs (   self,
  include_names = True 
)
Return a textual representation of the goal in DIMACS format.

Definition at line 5773 of file z3py.py.

5773 def dimacs(self, include_names=True):
5774 """Return a textual representation of the goal in DIMACS format."""
5775 return Z3_goal_to_dimacs_string(self.ctx.ref(), self.goal, include_names)
5776
Z3_string Z3_API Z3_goal_to_dimacs_string(Z3_context c, Z3_goal g, bool include_names)
Convert a goal into a DIMACS formatted string. The goal must be in CNF. You can convert a goal to CNF...

◆ get()

def get (   self,
  i 
)
Return a constraint in the goal `self`.

>>> g = Goal()
>>> x, y = Ints('x y')
>>> g.add(x == 0, y > x)
>>> g.get(0)
x == 0
>>> g.get(1)
y > x

Definition at line 5661 of file z3py.py.

5661 def get(self, i):
5662 """Return a constraint in the goal `self`.
5663
5664 >>> g = Goal()
5665 >>> x, y = Ints('x y')
5666 >>> g.add(x == 0, y > x)
5667 >>> g.get(0)
5668 x == 0
5669 >>> g.get(1)
5670 y > x
5671 """
5672 return _to_expr_ref(Z3_goal_formula(self.ctx.ref(), self.goal, i), self.ctx)
5673
Z3_ast Z3_API Z3_goal_formula(Z3_context c, Z3_goal g, unsigned idx)
Return a formula from the given goal.

Referenced by Goal.__getitem__(), and Goal.as_expr().

◆ inconsistent()

def inconsistent (   self)
Return `True` if `self` contains the `False` constraints.

>>> x, y = Ints('x y')
>>> g = Goal()
>>> g.inconsistent()
False
>>> g.add(x == 0, x == 1)
>>> g
[x == 0, x == 1]
>>> g.inconsistent()
False
>>> g2 = Tactic('propagate-values')(g)[0]
>>> g2.inconsistent()
True

Definition at line 5587 of file z3py.py.

5587 def inconsistent(self):
5588 """Return `True` if `self` contains the `False` constraints.
5589
5590 >>> x, y = Ints('x y')
5591 >>> g = Goal()
5592 >>> g.inconsistent()
5593 False
5594 >>> g.add(x == 0, x == 1)
5595 >>> g
5596 [x == 0, x == 1]
5597 >>> g.inconsistent()
5598 False
5599 >>> g2 = Tactic('propagate-values')(g)[0]
5600 >>> g2.inconsistent()
5601 True
5602 """
5603 return Z3_goal_inconsistent(self.ctx.ref(), self.goal)
5604
bool Z3_API Z3_goal_inconsistent(Z3_context c, Z3_goal g)
Return true if the given goal contains the formula false.

◆ insert()

def insert (   self,
args 
)
Add constraints.

>>> x = Int('x')
>>> g = Goal()
>>> g.insert(x > 0, x < 2)
>>> g
[x > 0, x < 2]

Definition at line 5715 of file z3py.py.

5715 def insert(self, *args):
5716 """Add constraints.
5717
5718 >>> x = Int('x')
5719 >>> g = Goal()
5720 >>> g.insert(x > 0, x < 2)
5721 >>> g
5722 [x > 0, x < 2]
5723 """
5724 self.assert_exprs(*args)
5725

◆ prec()

def prec (   self)
Return the precision (under-approximation, over-approximation, or precise) of the goal `self`.

>>> g = Goal()
>>> g.prec() == Z3_GOAL_PRECISE
True
>>> x, y = Ints('x y')
>>> g.add(x == y + 1)
>>> g.prec() == Z3_GOAL_PRECISE
True
>>> t  = With(Tactic('add-bounds'), add_bound_lower=0, add_bound_upper=10)
>>> g2 = t(g)[0]
>>> g2
[x == y + 1, x <= 10, x >= 0, y <= 10, y >= 0]
>>> g2.prec() == Z3_GOAL_PRECISE
False
>>> g2.prec() == Z3_GOAL_UNDER
True

Definition at line 5605 of file z3py.py.

5605 def prec(self):
5606 """Return the precision (under-approximation, over-approximation, or precise) of the goal `self`.
5607
5608 >>> g = Goal()
5609 >>> g.prec() == Z3_GOAL_PRECISE
5610 True
5611 >>> x, y = Ints('x y')
5612 >>> g.add(x == y + 1)
5613 >>> g.prec() == Z3_GOAL_PRECISE
5614 True
5615 >>> t = With(Tactic('add-bounds'), add_bound_lower=0, add_bound_upper=10)
5616 >>> g2 = t(g)[0]
5617 >>> g2
5618 [x == y + 1, x <= 10, x >= 0, y <= 10, y >= 0]
5619 >>> g2.prec() == Z3_GOAL_PRECISE
5620 False
5621 >>> g2.prec() == Z3_GOAL_UNDER
5622 True
5623 """
5624 return Z3_goal_precision(self.ctx.ref(), self.goal)
5625
Z3_goal_prec Z3_API Z3_goal_precision(Z3_context c, Z3_goal g)
Return the "precision" of the given goal. Goals can be transformed using over and under approximation...

Referenced by Goal.precision().

◆ precision()

def precision (   self)
Alias for `prec()`.

>>> g = Goal()
>>> g.precision() == Z3_GOAL_PRECISE
True

Definition at line 5626 of file z3py.py.

5626 def precision(self):
5627 """Alias for `prec()`.
5628
5629 >>> g = Goal()
5630 >>> g.precision() == Z3_GOAL_PRECISE
5631 True
5632 """
5633 return self.prec()
5634

◆ sexpr()

def sexpr (   self)
Return a textual representation of the s-expression representing the goal.

Definition at line 5769 of file z3py.py.

5769 def sexpr(self):
5770 """Return a textual representation of the s-expression representing the goal."""
5771 return Z3_goal_to_string(self.ctx.ref(), self.goal)
5772
Z3_string Z3_API Z3_goal_to_string(Z3_context c, Z3_goal g)
Convert a goal into a string.

Referenced by Fixedpoint.__repr__(), and Optimize.__repr__().

◆ simplify()

def simplify (   self,
arguments,
**  keywords 
)
Return a new simplified goal.

This method is essentially invoking the simplify tactic.

>>> g = Goal()
>>> x = Int('x')
>>> g.add(x + 1 >= 2)
>>> g
[x + 1 >= 2]
>>> g2 = g.simplify()
>>> g2
[x >= 1]
>>> # g was not modified
>>> g
[x + 1 >= 2]

Definition at line 5806 of file z3py.py.

5806 def simplify(self, *arguments, **keywords):
5807 """Return a new simplified goal.
5808
5809 This method is essentially invoking the simplify tactic.
5810
5811 >>> g = Goal()
5812 >>> x = Int('x')
5813 >>> g.add(x + 1 >= 2)
5814 >>> g
5815 [x + 1 >= 2]
5816 >>> g2 = g.simplify()
5817 >>> g2
5818 [x >= 1]
5819 >>> # g was not modified
5820 >>> g
5821 [x + 1 >= 2]
5822 """
5823 t = Tactic("simplify")
5824 return t.apply(self, *arguments, **keywords)[0]
5825

◆ size()

def size (   self)
Return the number of constraints in the goal `self`.

>>> g = Goal()
>>> g.size()
0
>>> x, y = Ints('x y')
>>> g.add(x == 0, y > x)
>>> g.size()
2

Definition at line 5635 of file z3py.py.

5635 def size(self):
5636 """Return the number of constraints in the goal `self`.
5637
5638 >>> g = Goal()
5639 >>> g.size()
5640 0
5641 >>> x, y = Ints('x y')
5642 >>> g.add(x == 0, y > x)
5643 >>> g.size()
5644 2
5645 """
5646 return int(Z3_goal_size(self.ctx.ref(), self.goal))
5647
unsigned Z3_API Z3_goal_size(Z3_context c, Z3_goal g)
Return the number of formulas in the given goal.

Referenced by ParamDescrsRef.__len__(), Goal.__len__(), BitVecNumRef.as_signed_long(), and BitVecSortRef.subsort().

◆ translate()

def translate (   self,
  target 
)
Copy goal `self` to context `target`.

>>> x = Int('x')
>>> g = Goal()
>>> g.add(x > 10)
>>> g
[x > 10]
>>> c2 = Context()
>>> g2 = g.translate(c2)
>>> g2
[x > 10]
>>> g.ctx == main_ctx()
True
>>> g2.ctx == c2
True
>>> g2.ctx == main_ctx()
False

Definition at line 5777 of file z3py.py.

5777 def translate(self, target):
5778 """Copy goal `self` to context `target`.
5779
5780 >>> x = Int('x')
5781 >>> g = Goal()
5782 >>> g.add(x > 10)
5783 >>> g
5784 [x > 10]
5785 >>> c2 = Context()
5786 >>> g2 = g.translate(c2)
5787 >>> g2
5788 [x > 10]
5789 >>> g.ctx == main_ctx()
5790 True
5791 >>> g2.ctx == c2
5792 True
5793 >>> g2.ctx == main_ctx()
5794 False
5795 """
5796 if z3_debug():
5797 _z3_assert(isinstance(target, Context), "target must be a context")
5798 return Goal(goal=Z3_goal_translate(self.ctx.ref(), self.goal, target.ref()), ctx=target)
5799
Z3_goal Z3_API Z3_goal_translate(Z3_context source, Z3_goal g, Z3_context target)
Copy a goal g from the context source to the context target.

Referenced by AstRef.__copy__(), Goal.__copy__(), AstVector.__copy__(), FuncInterp.__copy__(), ModelRef.__copy__(), Solver.__copy__(), Goal.__deepcopy__(), AstVector.__deepcopy__(), FuncInterp.__deepcopy__(), ModelRef.__deepcopy__(), and Solver.__deepcopy__().

Field Documentation

◆ ctx

ctx

Definition at line 5559 of file z3py.py.

Referenced by ArithRef.__add__(), BitVecRef.__add__(), FPRef.__add__(), BitVecRef.__and__(), FuncDeclRef.__call__(), Probe.__call__(), AstMap.__contains__(), AstRef.__copy__(), Goal.__copy__(), AstVector.__copy__(), FuncInterp.__copy__(), ModelRef.__copy__(), Solver.__copy__(), AstRef.__deepcopy__(), Datatype.__deepcopy__(), ParamsRef.__deepcopy__(), ParamDescrsRef.__deepcopy__(), Goal.__deepcopy__(), AstVector.__deepcopy__(), AstMap.__deepcopy__(), FuncEntry.__deepcopy__(), FuncInterp.__deepcopy__(), ModelRef.__deepcopy__(), Statistics.__deepcopy__(), Solver.__deepcopy__(), Fixedpoint.__deepcopy__(), Optimize.__deepcopy__(), ApplyResult.__deepcopy__(), Tactic.__deepcopy__(), Probe.__deepcopy__(), Context.__del__(), AstRef.__del__(), ScopedConstructor.__del__(), ScopedConstructorList.__del__(), ParamsRef.__del__(), ParamDescrsRef.__del__(), Goal.__del__(), AstVector.__del__(), AstMap.__del__(), FuncEntry.__del__(), FuncInterp.__del__(), ModelRef.__del__(), Statistics.__del__(), Solver.__del__(), Fixedpoint.__del__(), Optimize.__del__(), ApplyResult.__del__(), Tactic.__del__(), Probe.__del__(), ParserContext.__del__(), ArithRef.__div__(), BitVecRef.__div__(), FPRef.__div__(), ExprRef.__eq__(), Probe.__eq__(), ArithRef.__ge__(), BitVecRef.__ge__(), Probe.__ge__(), FPRef.__ge__(), SeqRef.__ge__(), AstVector.__getitem__(), SeqRef.__getitem__(), ModelRef.__getitem__(), Statistics.__getitem__(), ApplyResult.__getitem__(), AstMap.__getitem__(), ArithRef.__gt__(), BitVecRef.__gt__(), Probe.__gt__(), FPRef.__gt__(), SeqRef.__gt__(), BitVecRef.__invert__(), ArithRef.__le__(), BitVecRef.__le__(), Probe.__le__(), FPRef.__le__(), SeqRef.__le__(), CharRef.__le__(), AstVector.__len__(), AstMap.__len__(), ModelRef.__len__(), Statistics.__len__(), ApplyResult.__len__(), BitVecRef.__lshift__(), ArithRef.__lt__(), BitVecRef.__lt__(), Probe.__lt__(), FPRef.__lt__(), SeqRef.__lt__(), ArithRef.__mod__(), BitVecRef.__mod__(), BoolRef.__mul__(), ArithRef.__mul__(), BitVecRef.__mul__(), FPRef.__mul__(), ExprRef.__ne__(), Probe.__ne__(), ArithRef.__neg__(), BitVecRef.__neg__(), BitVecRef.__or__(), ArithRef.__pow__(), ArithRef.__radd__(), BitVecRef.__radd__(), FPRef.__radd__(), BitVecRef.__rand__(), ArithRef.__rdiv__(), BitVecRef.__rdiv__(), FPRef.__rdiv__(), ParamsRef.__repr__(), ParamDescrsRef.__repr__(), AstMap.__repr__(), Statistics.__repr__(), BitVecRef.__rlshift__(), ArithRef.__rmod__(), BitVecRef.__rmod__(), ArithRef.__rmul__(), BitVecRef.__rmul__(), FPRef.__rmul__(), BitVecRef.__ror__(), ArithRef.__rpow__(), BitVecRef.__rrshift__(), BitVecRef.__rshift__(), ArithRef.__rsub__(), BitVecRef.__rsub__(), FPRef.__rsub__(), BitVecRef.__rxor__(), AstVector.__setitem__(), AstMap.__setitem__(), ArithRef.__sub__(), BitVecRef.__sub__(), FPRef.__sub__(), BitVecRef.__xor__(), DatatypeSortRef.accessor(), Fixedpoint.add_cover(), ParserContext.add_decl(), Fixedpoint.add_rule(), Optimize.add_soft(), ParserContext.add_sort(), Tactic.apply(), AlgebraicNumRef.approx(), ExprRef.arg(), FuncEntry.arg_value(), FuncInterp.arity(), Goal.as_expr(), ApplyResult.as_expr(), FPNumRef.as_string(), Solver.assert_and_track(), Optimize.assert_and_track(), Goal.assert_exprs(), Solver.assert_exprs(), Fixedpoint.assert_exprs(), Optimize.assert_exprs(), Solver.assertions(), Optimize.assertions(), SeqRef.at(), SeqSortRef.basis(), ReSortRef.basis(), QuantifierRef.body(), BoolSortRef.cast(), Solver.check(), Optimize.check(), UserPropagateBase.conflict(), Solver.consequences(), DatatypeSortRef.constructor(), Goal.convert_model(), AstRef.ctx_ref(), UserPropagateBase.ctx_ref(), ExprRef.decl(), ModelRef.decls(), ArrayRef.default(), RatNumRef.denominator(), Goal.depth(), Goal.dimacs(), Solver.dimacs(), ArraySortRef.domain(), FuncDeclRef.domain(), ArraySortRef.domain_n(), FuncInterp.else_value(), FuncInterp.entry(), AstMap.erase(), ModelRef.eval(), FPNumRef.exponent(), FPNumRef.exponent_as_bv(), FPNumRef.exponent_as_long(), Solver.from_file(), Optimize.from_file(), Solver.from_string(), Optimize.from_string(), ParserContext.from_string(), Goal.get(), Fixedpoint.get_answer(), Fixedpoint.get_assertions(), Fixedpoint.get_cover_delta(), ParamDescrsRef.get_documentation(), Fixedpoint.get_ground_sat_answer(), ModelRef.get_interp(), Statistics.get_key_value(), ParamDescrsRef.get_kind(), ParamDescrsRef.get_name(), Fixedpoint.get_num_levels(), Fixedpoint.get_rule_names_along_trace(), Fixedpoint.get_rules(), Fixedpoint.get_rules_along_trace(), ModelRef.get_sort(), ModelRef.get_universe(), Solver.help(), Fixedpoint.help(), Optimize.help(), Tactic.help(), Solver.import_model_converter(), Goal.inconsistent(), CharRef.is_digit(), FPNumRef.isInf(), FPNumRef.isNaN(), FPNumRef.isNegative(), FPNumRef.isNormal(), FPNumRef.isPositive(), FPNumRef.isSubnormal(), FPNumRef.isZero(), AstMap.keys(), Statistics.keys(), SortRef.kind(), Optimize.maximize(), Optimize.minimize(), Solver.model(), Optimize.model(), SortRef.name(), FuncDeclRef.name(), Solver.next(), QuantifierRef.no_pattern(), Solver.non_units(), FuncEntry.num_args(), FuncInterp.num_entries(), Solver.num_scopes(), ModelRef.num_sorts(), RatNumRef.numerator(), Optimize.objectives(), Solver.param_descrs(), Fixedpoint.param_descrs(), Optimize.param_descrs(), Tactic.param_descrs(), FuncDeclRef.params(), Fixedpoint.parse_file(), Fixedpoint.parse_string(), QuantifierRef.pattern(), AlgebraicNumRef.poly(), Optimize.pop(), Solver.pop(), Goal.prec(), Solver.proof(), Solver.push(), Optimize.push(), AstVector.push(), Fixedpoint.query(), Fixedpoint.query_from_lvl(), FuncDeclRef.range(), ArraySortRef.range(), Solver.reason_unknown(), Fixedpoint.reason_unknown(), Optimize.reason_unknown(), DatatypeSortRef.recognizer(), Context.ref(), Fixedpoint.register_relation(), AstMap.reset(), Solver.reset(), AstVector.resize(), Solver.root(), Solver.set(), Fixedpoint.set(), Optimize.set(), ParamsRef.set(), Optimize.set_on_model(), Fixedpoint.set_predicate_representation(), Goal.sexpr(), AstVector.sexpr(), ModelRef.sexpr(), Solver.sexpr(), Fixedpoint.sexpr(), Optimize.sexpr(), ApplyResult.sexpr(), FPNumRef.sign(), FPNumRef.sign_as_bv(), FPNumRef.significand(), FPNumRef.significand_as_bv(), FPNumRef.significand_as_long(), ParamDescrsRef.size(), Goal.size(), Tactic.solver(), ExprRef.sort(), BoolRef.sort(), QuantifierRef.sort(), ArithRef.sort(), BitVecRef.sort(), ArrayRef.sort(), DatatypeRef.sort(), FiniteDomainRef.sort(), FPRef.sort(), SeqRef.sort(), Solver.statistics(), Fixedpoint.statistics(), Optimize.statistics(), CharRef.to_bv(), CharRef.to_int(), Solver.to_smt2(), Fixedpoint.to_string(), Solver.trail(), Solver.trail_levels(), AstVector.translate(), FuncInterp.translate(), AstRef.translate(), Goal.translate(), ModelRef.translate(), Solver.translate(), Solver.units(), Solver.unsat_core(), Optimize.unsat_core(), Fixedpoint.update_rule(), ParamsRef.validate(), FuncEntry.value(), QuantifierRef.var_name(), and QuantifierRef.var_sort().

◆ goal

goal