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 __deepcopy__ (self, memo={})
 
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)
 
def translate (self, target)
 
def __copy__ (self)
 
def __deepcopy__ (self)
 
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 5085 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 5093 of file z3py.py.

5093  def __init__(self, models=True, unsat_cores=False, proofs=False, ctx=None, goal=None):
5094  if __debug__:
5095  _z3_assert(goal is None or ctx is not None, "If goal is different from None, then ctx must be also different from None")
5096  self.ctx = _get_ctx(ctx)
5097  self.goal = goal
5098  if self.goal is None:
5099  self.goal = Z3_mk_goal(self.ctx.ref(), models, unsat_cores, proofs)
5100  Z3_goal_inc_ref(self.ctx.ref(), self.goal)
5101 
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...
void Z3_API Z3_goal_inc_ref(Z3_context c, Z3_goal g)
Increment the reference counter of the given goal.

◆ __del__()

def __del__ (   self)

Definition at line 5105 of file z3py.py.

5105  def __del__(self):
5106  if self.goal is not None and self.ctx.ref() is not None:
5107  Z3_goal_dec_ref(self.ctx.ref(), self.goal)
5108 
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 5339 of file z3py.py.

5339  def __copy__(self):
5340  return self.translate(self.ctx)
5341 

◆ __deepcopy__() [1/2]

def __deepcopy__ (   self,
  memo = {} 
)

Definition at line 5102 of file z3py.py.

5102  def __deepcopy__(self, memo={}):
5103  return Goal(False, False, False, self.ctx, self.goal)
5104 

Referenced by Goal.__deepcopy__().

◆ __deepcopy__() [2/2]

def __deepcopy__ (   self)

Definition at line 5342 of file z3py.py.

5342  def __deepcopy__(self):
5343  return self.translate(self.ctx)
5344 

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

5213  def __getitem__(self, arg):
5214  """Return a constraint in the goal `self`.
5215 
5216  >>> g = Goal()
5217  >>> x, y = Ints('x y')
5218  >>> g.add(x == 0, y > x)
5219  >>> g[0]
5220  x == 0
5221  >>> g[1]
5222  y > x
5223  """
5224  if arg >= len(self):
5225  raise IndexError
5226  return self.get(arg)
5227 

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

5187  def __len__(self):
5188  """Return the number of constraints in the goal `self`.
5189 
5190  >>> g = Goal()
5191  >>> len(g)
5192  0
5193  >>> x, y = Ints('x y')
5194  >>> g.add(x == 0, y > x)
5195  >>> len(g)
5196  2
5197  """
5198  return self.size()
5199 

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

◆ __repr__()

def __repr__ (   self)

Definition at line 5305 of file z3py.py.

5305  def __repr__(self):
5306  return obj_to_string(self)
5307 

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

5265  def add(self, *args):
5266  """Add constraints.
5267 
5268  >>> x = Int('x')
5269  >>> g = Goal()
5270  >>> g.add(x > 0, x < 2)
5271  >>> g
5272  [x > 0, x < 2]
5273  """
5274  self.assert_exprs(*args)
5275 

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

5243  def append(self, *args):
5244  """Add constraints.
5245 
5246  >>> x = Int('x')
5247  >>> g = Goal()
5248  >>> g.append(x > 0, x < 2)
5249  >>> g
5250  [x > 0, x < 2]
5251  """
5252  self.assert_exprs(*args)
5253 

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

5365  def as_expr(self):
5366  """Return goal `self` as a single Z3 expression.
5367 
5368  >>> x = Int('x')
5369  >>> g = Goal()
5370  >>> g.as_expr()
5371  True
5372  >>> g.add(x > 1)
5373  >>> g.as_expr()
5374  x > 1
5375  >>> g.add(x < 10)
5376  >>> g.as_expr()
5377  And(x > 1, x < 10)
5378  """
5379  sz = len(self)
5380  if sz == 0:
5381  return BoolVal(True, self.ctx)
5382  elif sz == 1:
5383  return self.get(0)
5384  else:
5385  return And([ self.get(i) for i in range(len(self)) ], self.ctx)
5386 
expr range(expr const &lo, expr const &hi)
Definition: z3++.h:3244
def And(*args)
Definition: z3py.py:1661
def BoolVal(val, ctx=None)
Definition: z3py.py:1529

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

5228  def assert_exprs(self, *args):
5229  """Assert constraints into the goal.
5230 
5231  >>> x = Int('x')
5232  >>> g = Goal()
5233  >>> g.assert_exprs(x > 0, x < 2)
5234  >>> g
5235  [x > 0, x < 2]
5236  """
5237  args = _get_args(args)
5238  s = BoolSort(self.ctx)
5239  for arg in args:
5240  arg = s.cast(arg)
5241  Z3_goal_assert(self.ctx.ref(), self.goal, arg.as_ast())
5242 
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:1512

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

5276  def convert_model(self, model):
5277  """Retrieve model from a satisfiable goal
5278  >>> a, b = Ints('a b')
5279  >>> g = Goal()
5280  >>> g.add(Or(a == 0, a == 1), Or(b == 0, b == 1), a > b)
5281  >>> t = Then(Tactic('split-clause'), Tactic('solve-eqs'))
5282  >>> r = t(g)
5283  >>> r[0]
5284  [Or(b == 0, b == 1), Not(0 <= b)]
5285  >>> r[1]
5286  [Or(b == 0, b == 1), Not(1 <= b)]
5287  >>> # Remark: the subgoal r[0] is unsatisfiable
5288  >>> # Creating a solver for solving the second subgoal
5289  >>> s = Solver()
5290  >>> s.add(r[1])
5291  >>> s.check()
5292  sat
5293  >>> s.model()
5294  [b = 0]
5295  >>> # Model s.model() does not assign a value to `a`
5296  >>> # It is a model for subgoal `r[1]`, but not for goal `g`
5297  >>> # The method convert_model creates a model for `g` from a model for `r[1]`.
5298  >>> r[1].convert_model(s.model())
5299  [b = 0, a = 1]
5300  """
5301  if __debug__:
5302  _z3_assert(isinstance(model, ModelRef), "Z3 Model expected")
5303  return ModelRef(Z3_goal_convert_model(self.ctx.ref(), self.goal, model.model), self.ctx)
5304 
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 5109 of file z3py.py.

5109  def depth(self):
5110  """Return the depth of the goal `self`. The depth corresponds to the number of tactics applied to `self`.
5111 
5112  >>> x, y = Ints('x y')
5113  >>> g = Goal()
5114  >>> g.add(x == 0, y >= x + 1)
5115  >>> g.depth()
5116  0
5117  >>> r = Then('simplify', 'solve-eqs')(g)
5118  >>> # r has 1 subgoal
5119  >>> len(r)
5120  1
5121  >>> r[0].depth()
5122  2
5123  """
5124  return int(Z3_goal_depth(self.ctx.ref(), self.goal))
5125 
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)
Return a textual representation of the goal in DIMACS format.

Definition at line 5312 of file z3py.py.

5312  def dimacs(self):
5313  """Return a textual representation of the goal in DIMACS format."""
5314  return Z3_goal_to_dimacs_string(self.ctx.ref(), self.goal)
5315 
Z3_string Z3_API Z3_goal_to_dimacs_string(Z3_context c, Z3_goal g)
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 5200 of file z3py.py.

5200  def get(self, i):
5201  """Return a constraint in the goal `self`.
5202 
5203  >>> g = Goal()
5204  >>> x, y = Ints('x y')
5205  >>> g.add(x == 0, y > x)
5206  >>> g.get(0)
5207  x == 0
5208  >>> g.get(1)
5209  y > x
5210  """
5211  return _to_expr_ref(Z3_goal_formula(self.ctx.ref(), self.goal, i), self.ctx)
5212 
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 5126 of file z3py.py.

5126  def inconsistent(self):
5127  """Return `True` if `self` contains the `False` constraints.
5128 
5129  >>> x, y = Ints('x y')
5130  >>> g = Goal()
5131  >>> g.inconsistent()
5132  False
5133  >>> g.add(x == 0, x == 1)
5134  >>> g
5135  [x == 0, x == 1]
5136  >>> g.inconsistent()
5137  False
5138  >>> g2 = Tactic('propagate-values')(g)[0]
5139  >>> g2.inconsistent()
5140  True
5141  """
5142  return Z3_goal_inconsistent(self.ctx.ref(), self.goal)
5143 
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 5254 of file z3py.py.

5254  def insert(self, *args):
5255  """Add constraints.
5256 
5257  >>> x = Int('x')
5258  >>> g = Goal()
5259  >>> g.insert(x > 0, x < 2)
5260  >>> g
5261  [x > 0, x < 2]
5262  """
5263  self.assert_exprs(*args)
5264 

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

5144  def prec(self):
5145  """Return the precision (under-approximation, over-approximation, or precise) of the goal `self`.
5146 
5147  >>> g = Goal()
5148  >>> g.prec() == Z3_GOAL_PRECISE
5149  True
5150  >>> x, y = Ints('x y')
5151  >>> g.add(x == y + 1)
5152  >>> g.prec() == Z3_GOAL_PRECISE
5153  True
5154  >>> t = With(Tactic('add-bounds'), add_bound_lower=0, add_bound_upper=10)
5155  >>> g2 = t(g)[0]
5156  >>> g2
5157  [x == y + 1, x <= 10, x >= 0, y <= 10, y >= 0]
5158  >>> g2.prec() == Z3_GOAL_PRECISE
5159  False
5160  >>> g2.prec() == Z3_GOAL_UNDER
5161  True
5162  """
5163  return Z3_goal_precision(self.ctx.ref(), self.goal)
5164 
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 5165 of file z3py.py.

5165  def precision(self):
5166  """Alias for `prec()`.
5167 
5168  >>> g = Goal()
5169  >>> g.precision() == Z3_GOAL_PRECISE
5170  True
5171  """
5172  return self.prec()
5173 

◆ sexpr()

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

Definition at line 5308 of file z3py.py.

5308  def sexpr(self):
5309  """Return a textual representation of the s-expression representing the goal."""
5310  return Z3_goal_to_string(self.ctx.ref(), self.goal)
5311 
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 5345 of file z3py.py.

5345  def simplify(self, *arguments, **keywords):
5346  """Return a new simplified goal.
5347 
5348  This method is essentially invoking the simplify tactic.
5349 
5350  >>> g = Goal()
5351  >>> x = Int('x')
5352  >>> g.add(x + 1 >= 2)
5353  >>> g
5354  [x + 1 >= 2]
5355  >>> g2 = g.simplify()
5356  >>> g2
5357  [x >= 1]
5358  >>> # g was not modified
5359  >>> g
5360  [x + 1 >= 2]
5361  """
5362  t = Tactic('simplify')
5363  return t.apply(self, *arguments, **keywords)[0]
5364 
def simplify(a, *arguments, **keywords)
Utils.
Definition: z3py.py:8086

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

5174  def size(self):
5175  """Return the number of constraints in the goal `self`.
5176 
5177  >>> g = Goal()
5178  >>> g.size()
5179  0
5180  >>> x, y = Ints('x y')
5181  >>> g.add(x == 0, y > x)
5182  >>> g.size()
5183  2
5184  """
5185  return int(Z3_goal_size(self.ctx.ref(), self.goal))
5186 
unsigned Z3_API Z3_goal_size(Z3_context c, Z3_goal g)
Return the number of formulas in the given goal.

Referenced by Goal.__len__().

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

5316  def translate(self, target):
5317  """Copy goal `self` to context `target`.
5318 
5319  >>> x = Int('x')
5320  >>> g = Goal()
5321  >>> g.add(x > 10)
5322  >>> g
5323  [x > 10]
5324  >>> c2 = Context()
5325  >>> g2 = g.translate(c2)
5326  >>> g2
5327  [x > 10]
5328  >>> g.ctx == main_ctx()
5329  True
5330  >>> g2.ctx == c2
5331  True
5332  >>> g2.ctx == main_ctx()
5333  False
5334  """
5335  if __debug__:
5336  _z3_assert(isinstance(target, Context), "target must be a context")
5337  return Goal(goal=Z3_goal_translate(self.ctx.ref(), self.goal, target.ref()), ctx=target)
5338 
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 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 5096 of file z3py.py.

Referenced by Probe.__call__(), AstMap.__contains__(), Goal.__copy__(), AstVector.__copy__(), FuncInterp.__copy__(), ModelRef.__copy__(), Solver.__copy__(), 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__(), 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__(), Probe.__eq__(), Probe.__ge__(), AstVector.__getitem__(), AstMap.__getitem__(), ModelRef.__getitem__(), Statistics.__getitem__(), ApplyResult.__getitem__(), Probe.__gt__(), Probe.__le__(), AstVector.__len__(), AstMap.__len__(), ModelRef.__len__(), Statistics.__len__(), ApplyResult.__len__(), Probe.__lt__(), Probe.__ne__(), AstMap.__repr__(), Statistics.__repr__(), AstVector.__setitem__(), AstMap.__setitem__(), Fixedpoint.add_cover(), Fixedpoint.add_rule(), Optimize.add_soft(), Tactic.apply(), FuncEntry.arg_value(), FuncInterp.arity(), Goal.as_expr(), ApplyResult.as_expr(), Solver.assert_and_track(), Goal.assert_exprs(), Solver.assert_exprs(), Fixedpoint.assert_exprs(), Optimize.assert_exprs(), Solver.assertions(), Optimize.assertions(), Solver.check(), Optimize.check(), Solver.consequences(), Goal.convert_model(), ModelRef.decls(), Goal.depth(), Goal.dimacs(), FuncInterp.else_value(), FuncInterp.entry(), AstMap.erase(), ModelRef.eval(), Solver.from_file(), Optimize.from_file(), Solver.from_string(), Optimize.from_string(), Goal.get(), Fixedpoint.get_answer(), Fixedpoint.get_assertions(), Fixedpoint.get_cover_delta(), Fixedpoint.get_ground_sat_answer(), ModelRef.get_interp(), Statistics.get_key_value(), 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(), Goal.inconsistent(), AstMap.keys(), Statistics.keys(), Optimize.maximize(), Optimize.minimize(), Solver.model(), Optimize.model(), Solver.non_units(), FuncEntry.num_args(), FuncInterp.num_entries(), Solver.num_scopes(), ModelRef.num_sorts(), Optimize.objectives(), Solver.param_descrs(), Fixedpoint.param_descrs(), Optimize.param_descrs(), Tactic.param_descrs(), Fixedpoint.parse_file(), Fixedpoint.parse_string(), Solver.pop(), Fixedpoint.pop(), Optimize.pop(), Goal.prec(), Solver.proof(), AstVector.push(), Solver.push(), Fixedpoint.push(), Optimize.push(), Fixedpoint.query(), Fixedpoint.query_from_lvl(), Solver.reason_unknown(), Fixedpoint.reason_unknown(), Optimize.reason_unknown(), Fixedpoint.register_relation(), AstMap.reset(), Solver.reset(), AstVector.resize(), Solver.set(), Fixedpoint.set(), Optimize.set(), Fixedpoint.set_predicate_representation(), Goal.sexpr(), AstVector.sexpr(), ModelRef.sexpr(), Solver.sexpr(), Fixedpoint.sexpr(), Optimize.sexpr(), ApplyResult.sexpr(), Goal.size(), Tactic.solver(), Solver.statistics(), Fixedpoint.statistics(), Optimize.statistics(), Solver.to_smt2(), Fixedpoint.to_string(), Goal.translate(), AstVector.translate(), FuncInterp.translate(), ModelRef.translate(), Solver.translate(), Solver.units(), Solver.unsat_core(), Optimize.unsat_core(), Fixedpoint.update_rule(), and FuncEntry.value().

◆ goal

goal