Z3
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
 

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 5479 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 5487 of file z3py.py.

5487  def __init__(self, models=True, unsat_cores=False, proofs=False, ctx=None, goal=None):
5488  if z3_debug():
5489  _z3_assert(goal is None or ctx is not None,
5490  "If goal is different from None, then ctx must be also different from None")
5491  self.ctx = _get_ctx(ctx)
5492  self.goal = goal
5493  if self.goal is None:
5494  self.goal = Z3_mk_goal(self.ctx.ref(), models, unsat_cores, proofs)
5495  Z3_goal_inc_ref(self.ctx.ref(), self.goal)
5496 
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...
def z3_debug()
Definition: z3py.py:64

◆ __del__()

def __del__ (   self)

Definition at line 5497 of file z3py.py.

5497  def __del__(self):
5498  if self.goal is not None and self.ctx.ref() is not None:
5499  Z3_goal_dec_ref(self.ctx.ref(), self.goal)
5500 
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 5732 of file z3py.py.

5732  def __copy__(self):
5733  return self.translate(self.ctx)
5734 

◆ __deepcopy__()

def __deepcopy__ (   self,
  memo = {} 
)

Definition at line 5735 of file z3py.py.

5735  def __deepcopy__(self, memo={}):
5736  return self.translate(self.ctx)
5737 

◆ __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 5606 of file z3py.py.

5606  def __getitem__(self, arg):
5607  """Return a constraint in the goal `self`.
5608 
5609  >>> g = Goal()
5610  >>> x, y = Ints('x y')
5611  >>> g.add(x == 0, y > x)
5612  >>> g[0]
5613  x == 0
5614  >>> g[1]
5615  y > x
5616  """
5617  if arg >= len(self):
5618  raise IndexError
5619  return self.get(arg)
5620 

◆ __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 5580 of file z3py.py.

5580  def __len__(self):
5581  """Return the number of constraints in the goal `self`.
5582 
5583  >>> g = Goal()
5584  >>> len(g)
5585  0
5586  >>> x, y = Ints('x y')
5587  >>> g.add(x == 0, y > x)
5588  >>> len(g)
5589  2
5590  """
5591  return self.size()
5592 

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

◆ __repr__()

def __repr__ (   self)

Definition at line 5698 of file z3py.py.

5698  def __repr__(self):
5699  return obj_to_string(self)
5700 

◆ 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 5658 of file z3py.py.

5658  def add(self, *args):
5659  """Add constraints.
5660 
5661  >>> x = Int('x')
5662  >>> g = Goal()
5663  >>> g.add(x > 0, x < 2)
5664  >>> g
5665  [x > 0, x < 2]
5666  """
5667  self.assert_exprs(*args)
5668 

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 5636 of file z3py.py.

5636  def append(self, *args):
5637  """Add constraints.
5638 
5639  >>> x = Int('x')
5640  >>> g = Goal()
5641  >>> g.append(x > 0, x < 2)
5642  >>> g
5643  [x > 0, x < 2]
5644  """
5645  self.assert_exprs(*args)
5646 

◆ 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 5758 of file z3py.py.

5758  def as_expr(self):
5759  """Return goal `self` as a single Z3 expression.
5760 
5761  >>> x = Int('x')
5762  >>> g = Goal()
5763  >>> g.as_expr()
5764  True
5765  >>> g.add(x > 1)
5766  >>> g.as_expr()
5767  x > 1
5768  >>> g.add(x < 10)
5769  >>> g.as_expr()
5770  And(x > 1, x < 10)
5771  """
5772  sz = len(self)
5773  if sz == 0:
5774  return BoolVal(True, self.ctx)
5775  elif sz == 1:
5776  return self.get(0)
5777  else:
5778  return And([self.get(i) for i in range(len(self))], self.ctx)
5779 
expr range(expr const &lo, expr const &hi)
Definition: z3++.h:3810
def BoolVal(val, ctx=None)
Definition: z3py.py:1675
def And(*args)
Definition: z3py.py:1815

◆ 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 5621 of file z3py.py.

5621  def assert_exprs(self, *args):
5622  """Assert constraints into the goal.
5623 
5624  >>> x = Int('x')
5625  >>> g = Goal()
5626  >>> g.assert_exprs(x > 0, x < 2)
5627  >>> g
5628  [x > 0, x < 2]
5629  """
5630  args = _get_args(args)
5631  s = BoolSort(self.ctx)
5632  for arg in args:
5633  arg = s.cast(arg)
5634  Z3_goal_assert(self.ctx.ref(), self.goal, arg.as_ast())
5635 
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...
def BoolSort(ctx=None)
Definition: z3py.py:1657

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 5669 of file z3py.py.

5669  def convert_model(self, model):
5670  """Retrieve model from a satisfiable goal
5671  >>> a, b = Ints('a b')
5672  >>> g = Goal()
5673  >>> g.add(Or(a == 0, a == 1), Or(b == 0, b == 1), a > b)
5674  >>> t = Then(Tactic('split-clause'), Tactic('solve-eqs'))
5675  >>> r = t(g)
5676  >>> r[0]
5677  [Or(b == 0, b == 1), Not(0 <= b)]
5678  >>> r[1]
5679  [Or(b == 0, b == 1), Not(1 <= b)]
5680  >>> # Remark: the subgoal r[0] is unsatisfiable
5681  >>> # Creating a solver for solving the second subgoal
5682  >>> s = Solver()
5683  >>> s.add(r[1])
5684  >>> s.check()
5685  sat
5686  >>> s.model()
5687  [b = 0]
5688  >>> # Model s.model() does not assign a value to `a`
5689  >>> # It is a model for subgoal `r[1]`, but not for goal `g`
5690  >>> # The method convert_model creates a model for `g` from a model for `r[1]`.
5691  >>> r[1].convert_model(s.model())
5692  [b = 0, a = 1]
5693  """
5694  if z3_debug():
5695  _z3_assert(isinstance(model, ModelRef), "Z3 Model expected")
5696  return ModelRef(Z3_goal_convert_model(self.ctx.ref(), self.goal, model.model), self.ctx)
5697 
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,...

◆ 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 5501 of file z3py.py.

5501  def depth(self):
5502  """Return the depth of the goal `self`.
5503  The depth corresponds to the number of tactics applied to `self`.
5504 
5505  >>> x, y = Ints('x y')
5506  >>> g = Goal()
5507  >>> g.add(x == 0, y >= x + 1)
5508  >>> g.depth()
5509  0
5510  >>> r = Then('simplify', 'solve-eqs')(g)
5511  >>> # r has 1 subgoal
5512  >>> len(r)
5513  1
5514  >>> r[0].depth()
5515  2
5516  """
5517  return int(Z3_goal_depth(self.ctx.ref(), self.goal))
5518 
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.

◆ dimacs()

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

Definition at line 5705 of file z3py.py.

5705  def dimacs(self, include_names=True):
5706  """Return a textual representation of the goal in DIMACS format."""
5707  return Z3_goal_to_dimacs_string(self.ctx.ref(), self.goal, include_names)
5708 
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 5593 of file z3py.py.

5593  def get(self, i):
5594  """Return a constraint in the goal `self`.
5595 
5596  >>> g = Goal()
5597  >>> x, y = Ints('x y')
5598  >>> g.add(x == 0, y > x)
5599  >>> g.get(0)
5600  x == 0
5601  >>> g.get(1)
5602  y > x
5603  """
5604  return _to_expr_ref(Z3_goal_formula(self.ctx.ref(), self.goal, i), self.ctx)
5605 
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 5519 of file z3py.py.

5519  def inconsistent(self):
5520  """Return `True` if `self` contains the `False` constraints.
5521 
5522  >>> x, y = Ints('x y')
5523  >>> g = Goal()
5524  >>> g.inconsistent()
5525  False
5526  >>> g.add(x == 0, x == 1)
5527  >>> g
5528  [x == 0, x == 1]
5529  >>> g.inconsistent()
5530  False
5531  >>> g2 = Tactic('propagate-values')(g)[0]
5532  >>> g2.inconsistent()
5533  True
5534  """
5535  return Z3_goal_inconsistent(self.ctx.ref(), self.goal)
5536 
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 5647 of file z3py.py.

5647  def insert(self, *args):
5648  """Add constraints.
5649 
5650  >>> x = Int('x')
5651  >>> g = Goal()
5652  >>> g.insert(x > 0, x < 2)
5653  >>> g
5654  [x > 0, x < 2]
5655  """
5656  self.assert_exprs(*args)
5657 

◆ 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 5537 of file z3py.py.

5537  def prec(self):
5538  """Return the precision (under-approximation, over-approximation, or precise) of the goal `self`.
5539 
5540  >>> g = Goal()
5541  >>> g.prec() == Z3_GOAL_PRECISE
5542  True
5543  >>> x, y = Ints('x y')
5544  >>> g.add(x == y + 1)
5545  >>> g.prec() == Z3_GOAL_PRECISE
5546  True
5547  >>> t = With(Tactic('add-bounds'), add_bound_lower=0, add_bound_upper=10)
5548  >>> g2 = t(g)[0]
5549  >>> g2
5550  [x == y + 1, x <= 10, x >= 0, y <= 10, y >= 0]
5551  >>> g2.prec() == Z3_GOAL_PRECISE
5552  False
5553  >>> g2.prec() == Z3_GOAL_UNDER
5554  True
5555  """
5556  return Z3_goal_precision(self.ctx.ref(), self.goal)
5557 
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 5558 of file z3py.py.

5558  def precision(self):
5559  """Alias for `prec()`.
5560 
5561  >>> g = Goal()
5562  >>> g.precision() == Z3_GOAL_PRECISE
5563  True
5564  """
5565  return self.prec()
5566 

◆ sexpr()

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

Definition at line 5701 of file z3py.py.

5701  def sexpr(self):
5702  """Return a textual representation of the s-expression representing the goal."""
5703  return Z3_goal_to_string(self.ctx.ref(), self.goal)
5704 
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 5738 of file z3py.py.

5738  def simplify(self, *arguments, **keywords):
5739  """Return a new simplified goal.
5740 
5741  This method is essentially invoking the simplify tactic.
5742 
5743  >>> g = Goal()
5744  >>> x = Int('x')
5745  >>> g.add(x + 1 >= 2)
5746  >>> g
5747  [x + 1 >= 2]
5748  >>> g2 = g.simplify()
5749  >>> g2
5750  [x >= 1]
5751  >>> # g was not modified
5752  >>> g
5753  [x + 1 >= 2]
5754  """
5755  t = Tactic("simplify")
5756  return t.apply(self, *arguments, **keywords)[0]
5757 
def simplify(a, *arguments, **keywords)
Utils.
Definition: z3py.py:8656

◆ 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 5567 of file z3py.py.

5567  def size(self):
5568  """Return the number of constraints in the goal `self`.
5569 
5570  >>> g = Goal()
5571  >>> g.size()
5572  0
5573  >>> x, y = Ints('x y')
5574  >>> g.add(x == 0, y > x)
5575  >>> g.size()
5576  2
5577  """
5578  return int(Z3_goal_size(self.ctx.ref(), self.goal))
5579 
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 5709 of file z3py.py.

5709  def translate(self, target):
5710  """Copy goal `self` to context `target`.
5711 
5712  >>> x = Int('x')
5713  >>> g = Goal()
5714  >>> g.add(x > 10)
5715  >>> g
5716  [x > 10]
5717  >>> c2 = Context()
5718  >>> g2 = g.translate(c2)
5719  >>> g2
5720  [x > 10]
5721  >>> g.ctx == main_ctx()
5722  True
5723  >>> g2.ctx == c2
5724  True
5725  >>> g2.ctx == main_ctx()
5726  False
5727  """
5728  if z3_debug():
5729  _z3_assert(isinstance(target, Context), "target must be a context")
5730  return Goal(goal=Z3_goal_translate(self.ctx.ref(), self.goal, target.ref()), ctx=target)
5731 
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 5491 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__(), ArithRef.__div__(), BitVecRef.__div__(), FPRef.__div__(), ExprRef.__eq__(), Probe.__eq__(), ArithRef.__ge__(), BitVecRef.__ge__(), Probe.__ge__(), FPRef.__ge__(), SeqRef.__ge__(), QuantifierRef.__getitem__(), ArrayRef.__getitem__(), 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__(), 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__(), 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(), Fixedpoint.add_rule(), Optimize.add_soft(), 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(), 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(), 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(), 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(), 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.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(), 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