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, 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 5189 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 5197 of file z3py.py.

5197  def __init__(self, models=True, unsat_cores=False, proofs=False, ctx=None, goal=None):
5198  if z3_debug():
5199  _z3_assert(goal is None or ctx is not None, "If goal is different from None, then ctx must be also different from None")
5200  self.ctx = _get_ctx(ctx)
5201  self.goal = goal
5202  if self.goal is None:
5203  self.goal = Z3_mk_goal(self.ctx.ref(), models, unsat_cores, proofs)
5204  Z3_goal_inc_ref(self.ctx.ref(), self.goal)
5205 

◆ __del__()

def __del__ (   self)

Definition at line 5209 of file z3py.py.

5209  def __del__(self):
5210  if self.goal is not None and self.ctx.ref() is not None:
5211  Z3_goal_dec_ref(self.ctx.ref(), self.goal)
5212 

Member Function Documentation

◆ __copy__()

def __copy__ (   self)

Definition at line 5443 of file z3py.py.

5443  def __copy__(self):
5444  return self.translate(self.ctx)
5445 

◆ __deepcopy__() [1/2]

def __deepcopy__ (   self,
  memo = {} 
)

Definition at line 5206 of file z3py.py.

5206  def __deepcopy__(self, memo={}):
5207  return Goal(False, False, False, self.ctx, self.goal)
5208 

Referenced by Goal.__deepcopy__().

◆ __deepcopy__() [2/2]

def __deepcopy__ (   self,
  memo = {} 
)

Definition at line 5446 of file z3py.py.

5446  def __deepcopy__(self, memo={}):
5447  return self.translate(self.ctx)
5448 

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

5317  def __getitem__(self, arg):
5318  """Return a constraint in the goal `self`.
5319 
5320  >>> g = Goal()
5321  >>> x, y = Ints('x y')
5322  >>> g.add(x == 0, y > x)
5323  >>> g[0]
5324  x == 0
5325  >>> g[1]
5326  y > x
5327  """
5328  if arg >= len(self):
5329  raise IndexError
5330  return self.get(arg)
5331 

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

5291  def __len__(self):
5292  """Return the number of constraints in the goal `self`.
5293 
5294  >>> g = Goal()
5295  >>> len(g)
5296  0
5297  >>> x, y = Ints('x y')
5298  >>> g.add(x == 0, y > x)
5299  >>> len(g)
5300  2
5301  """
5302  return self.size()
5303 

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

◆ __repr__()

def __repr__ (   self)

Definition at line 5409 of file z3py.py.

5409  def __repr__(self):
5410  return obj_to_string(self)
5411 

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

5369  def add(self, *args):
5370  """Add constraints.
5371 
5372  >>> x = Int('x')
5373  >>> g = Goal()
5374  >>> g.add(x > 0, x < 2)
5375  >>> g
5376  [x > 0, x < 2]
5377  """
5378  self.assert_exprs(*args)
5379 

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

5347  def append(self, *args):
5348  """Add constraints.
5349 
5350  >>> x = Int('x')
5351  >>> g = Goal()
5352  >>> g.append(x > 0, x < 2)
5353  >>> g
5354  [x > 0, x < 2]
5355  """
5356  self.assert_exprs(*args)
5357 

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

5469  def as_expr(self):
5470  """Return goal `self` as a single Z3 expression.
5471 
5472  >>> x = Int('x')
5473  >>> g = Goal()
5474  >>> g.as_expr()
5475  True
5476  >>> g.add(x > 1)
5477  >>> g.as_expr()
5478  x > 1
5479  >>> g.add(x < 10)
5480  >>> g.as_expr()
5481  And(x > 1, x < 10)
5482  """
5483  sz = len(self)
5484  if sz == 0:
5485  return BoolVal(True, self.ctx)
5486  elif sz == 1:
5487  return self.get(0)
5488  else:
5489  return And([ self.get(i) for i in range(len(self)) ], self.ctx)
5490 

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

5332  def assert_exprs(self, *args):
5333  """Assert constraints into the goal.
5334 
5335  >>> x = Int('x')
5336  >>> g = Goal()
5337  >>> g.assert_exprs(x > 0, x < 2)
5338  >>> g
5339  [x > 0, x < 2]
5340  """
5341  args = _get_args(args)
5342  s = BoolSort(self.ctx)
5343  for arg in args:
5344  arg = s.cast(arg)
5345  Z3_goal_assert(self.ctx.ref(), self.goal, arg.as_ast())
5346 

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

5380  def convert_model(self, model):
5381  """Retrieve model from a satisfiable goal
5382  >>> a, b = Ints('a b')
5383  >>> g = Goal()
5384  >>> g.add(Or(a == 0, a == 1), Or(b == 0, b == 1), a > b)
5385  >>> t = Then(Tactic('split-clause'), Tactic('solve-eqs'))
5386  >>> r = t(g)
5387  >>> r[0]
5388  [Or(b == 0, b == 1), Not(0 <= b)]
5389  >>> r[1]
5390  [Or(b == 0, b == 1), Not(1 <= b)]
5391  >>> # Remark: the subgoal r[0] is unsatisfiable
5392  >>> # Creating a solver for solving the second subgoal
5393  >>> s = Solver()
5394  >>> s.add(r[1])
5395  >>> s.check()
5396  sat
5397  >>> s.model()
5398  [b = 0]
5399  >>> # Model s.model() does not assign a value to `a`
5400  >>> # It is a model for subgoal `r[1]`, but not for goal `g`
5401  >>> # The method convert_model creates a model for `g` from a model for `r[1]`.
5402  >>> r[1].convert_model(s.model())
5403  [b = 0, a = 1]
5404  """
5405  if z3_debug():
5406  _z3_assert(isinstance(model, ModelRef), "Z3 Model expected")
5407  return ModelRef(Z3_goal_convert_model(self.ctx.ref(), self.goal, model.model), self.ctx)
5408 

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

5213  def depth(self):
5214  """Return the depth of the goal `self`. The depth corresponds to the number of tactics applied to `self`.
5215 
5216  >>> x, y = Ints('x y')
5217  >>> g = Goal()
5218  >>> g.add(x == 0, y >= x + 1)
5219  >>> g.depth()
5220  0
5221  >>> r = Then('simplify', 'solve-eqs')(g)
5222  >>> # r has 1 subgoal
5223  >>> len(r)
5224  1
5225  >>> r[0].depth()
5226  2
5227  """
5228  return int(Z3_goal_depth(self.ctx.ref(), self.goal))
5229 

◆ dimacs()

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

Definition at line 5416 of file z3py.py.

5416  def dimacs(self, include_names = True):
5417  """Return a textual representation of the goal in DIMACS format."""
5418  return Z3_goal_to_dimacs_string(self.ctx.ref(), self.goal, include_names)
5419 

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

5304  def get(self, i):
5305  """Return a constraint in the goal `self`.
5306 
5307  >>> g = Goal()
5308  >>> x, y = Ints('x y')
5309  >>> g.add(x == 0, y > x)
5310  >>> g.get(0)
5311  x == 0
5312  >>> g.get(1)
5313  y > x
5314  """
5315  return _to_expr_ref(Z3_goal_formula(self.ctx.ref(), self.goal, i), self.ctx)
5316 

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

5230  def inconsistent(self):
5231  """Return `True` if `self` contains the `False` constraints.
5232 
5233  >>> x, y = Ints('x y')
5234  >>> g = Goal()
5235  >>> g.inconsistent()
5236  False
5237  >>> g.add(x == 0, x == 1)
5238  >>> g
5239  [x == 0, x == 1]
5240  >>> g.inconsistent()
5241  False
5242  >>> g2 = Tactic('propagate-values')(g)[0]
5243  >>> g2.inconsistent()
5244  True
5245  """
5246  return Z3_goal_inconsistent(self.ctx.ref(), self.goal)
5247 

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

5358  def insert(self, *args):
5359  """Add constraints.
5360 
5361  >>> x = Int('x')
5362  >>> g = Goal()
5363  >>> g.insert(x > 0, x < 2)
5364  >>> g
5365  [x > 0, x < 2]
5366  """
5367  self.assert_exprs(*args)
5368 

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

5248  def prec(self):
5249  """Return the precision (under-approximation, over-approximation, or precise) of the goal `self`.
5250 
5251  >>> g = Goal()
5252  >>> g.prec() == Z3_GOAL_PRECISE
5253  True
5254  >>> x, y = Ints('x y')
5255  >>> g.add(x == y + 1)
5256  >>> g.prec() == Z3_GOAL_PRECISE
5257  True
5258  >>> t = With(Tactic('add-bounds'), add_bound_lower=0, add_bound_upper=10)
5259  >>> g2 = t(g)[0]
5260  >>> g2
5261  [x == y + 1, x <= 10, x >= 0, y <= 10, y >= 0]
5262  >>> g2.prec() == Z3_GOAL_PRECISE
5263  False
5264  >>> g2.prec() == Z3_GOAL_UNDER
5265  True
5266  """
5267  return Z3_goal_precision(self.ctx.ref(), self.goal)
5268 

Referenced by Goal.precision().

◆ precision()

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

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

Definition at line 5269 of file z3py.py.

5269  def precision(self):
5270  """Alias for `prec()`.
5271 
5272  >>> g = Goal()
5273  >>> g.precision() == Z3_GOAL_PRECISE
5274  True
5275  """
5276  return self.prec()
5277 

◆ sexpr()

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

Definition at line 5412 of file z3py.py.

5412  def sexpr(self):
5413  """Return a textual representation of the s-expression representing the goal."""
5414  return Z3_goal_to_string(self.ctx.ref(), self.goal)
5415 

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

5449  def simplify(self, *arguments, **keywords):
5450  """Return a new simplified goal.
5451 
5452  This method is essentially invoking the simplify tactic.
5453 
5454  >>> g = Goal()
5455  >>> x = Int('x')
5456  >>> g.add(x + 1 >= 2)
5457  >>> g
5458  [x + 1 >= 2]
5459  >>> g2 = g.simplify()
5460  >>> g2
5461  [x >= 1]
5462  >>> # g was not modified
5463  >>> g
5464  [x + 1 >= 2]
5465  """
5466  t = Tactic('simplify')
5467  return t.apply(self, *arguments, **keywords)[0]
5468 

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

5278  def size(self):
5279  """Return the number of constraints in the goal `self`.
5280 
5281  >>> g = Goal()
5282  >>> g.size()
5283  0
5284  >>> x, y = Ints('x y')
5285  >>> g.add(x == 0, y > x)
5286  >>> g.size()
5287  2
5288  """
5289  return int(Z3_goal_size(self.ctx.ref(), self.goal))
5290 

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

5420  def translate(self, target):
5421  """Copy goal `self` to context `target`.
5422 
5423  >>> x = Int('x')
5424  >>> g = Goal()
5425  >>> g.add(x > 10)
5426  >>> g
5427  [x > 10]
5428  >>> c2 = Context()
5429  >>> g2 = g.translate(c2)
5430  >>> g2
5431  [x > 10]
5432  >>> g.ctx == main_ctx()
5433  True
5434  >>> g2.ctx == c2
5435  True
5436  >>> g2.ctx == main_ctx()
5437  False
5438  """
5439  if z3_debug():
5440  _z3_assert(isinstance(target, Context), "target must be a context")
5441  return Goal(goal=Z3_goal_translate(self.ctx.ref(), self.goal, target.ref()), ctx=target)
5442 

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 5200 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(), Optimize.assert_and_track(), Goal.assert_exprs(), Solver.assert_exprs(), Fixedpoint.assert_exprs(), Optimize.assert_exprs(), Solver.assertions(), Optimize.assertions(), Solver.check(), Optimize.check(), UserPropagateBase.conflict(), Solver.consequences(), Goal.convert_model(), UserPropagateBase.ctx_ref(), ModelRef.decls(), Goal.depth(), Goal.dimacs(), Solver.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(), Solver.import_model_converter(), 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(), Optimize.pop(), Goal.prec(), Solver.proof(), AstVector.push(), Solver.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(), Solver.trail(), Solver.trail_levels(), 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
z3py.UserPropagateBase.__init__
def __init__(self, s, ctx=None)
Definition: z3py.py:10582
z3::range
expr range(expr const &lo, expr const &hi)
Definition: z3++.h:3515
Z3_goal_precision
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...
Z3_goal_size
unsigned Z3_API Z3_goal_size(Z3_context c, Z3_goal g)
Return the number of formulas in the given goal.
Z3_mk_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...
z3py.simplify
def simplify(a, *arguments, **keywords)
Utils.
Definition: z3py.py:8224
Z3_goal_formula
Z3_ast Z3_API Z3_goal_formula(Z3_context c, Z3_goal g, unsigned idx)
Return a formula from the given goal.
Z3_goal_depth
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.
z3py.And
def And(*args)
Definition: z3py.py:1700
z3py.UserPropagateBase.__del__
def __del__(self)
Definition: z3py.py:10607
Z3_goal_dec_ref
void Z3_API Z3_goal_dec_ref(Z3_context c, Z3_goal g)
Decrement the reference counter of the given goal.
Z3_goal_translate
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.
Z3_goal_to_string
Z3_string Z3_API Z3_goal_to_string(Z3_context c, Z3_goal g)
Convert a goal into a string.
Z3_goal_inc_ref
void Z3_API Z3_goal_inc_ref(Z3_context c, Z3_goal g)
Increment the reference counter of the given goal.
z3py.z3_debug
def z3_debug()
Definition: z3py.py:56
Z3_goal_to_dimacs_string
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...
Z3_goal_assert
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...
z3py.BoolVal
def BoolVal(val, ctx=None)
Definition: z3py.py:1570
Z3_goal_convert_model
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,...
z3py.UserPropagateBase.add
def add(self, e)
Definition: z3py.py:10653
z3py.BoolSort
def BoolSort(ctx=None)
Definition: z3py.py:1553
Z3_goal_inconsistent
bool Z3_API Z3_goal_inconsistent(Z3_context c, Z3_goal g)
Return true if the given goal contains the formula false.