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

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

## ◆ __del__()

def __del__ | ( |  | self | ) |

Definition at line 5495 of file z3py.py.

5495 def __del__(self):
5496 if self.goal is not None and self.ctx.ref() is not None:
5497 Z3_goal_dec_ref(self.ctx.ref(), self.goal)
5498
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.

## Member Function Documentation

## ◆ __copy__()

def __copy__ | ( |  | self | ) |

Definition at line 5730 of file z3py.py.

5730 def __copy__(self):
5731 return self.translate(self.ctx)
5732

## ◆ __deepcopy__()

def __deepcopy__ | ( |  | self,
|  |  | memo = `{}`
| ) |  |

Definition at line 5733 of file z3py.py.

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

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

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

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

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

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

## ◆ __repr__()

def __repr__ | ( |  | self | ) |

Definition at line 5696 of file z3py.py.

5696 def __repr__(self):
5697 return obj_to_string(self)
5698

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

5656 def add(self, *args):
5657 """Add constraints.
5658
5659 >>> x = Int('x')
5660 >>> g = Goal()
5661 >>> g.add(x > 0, x < 2)
5662 >>> g
5663 [x > 0, x < 2]
5664 """
5665 self.assert_exprs(*args)
5666
z3py.Int
def Int(name, ctx=None)
Definition: z3py.py:3210

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

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

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

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

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

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

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

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

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

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

Referenced by Goal.depth().

## ◆ dimacs()

def dimacs | ( |  | self,
|  |  | include_names = `True`
| ) |  |

    Return a textual representation of the goal in DIMACS format.

Definition at line 5703 of file z3py.py.

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

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

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

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

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

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

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

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

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

Referenced by Goal.precision().

## ◆ precision()

def precision | ( |  | self | ) |

    Alias for `prec()`.

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

Definition at line 5556 of file z3py.py.

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

## ◆ sexpr()

def sexpr | ( |  | self | ) |

    Return a textual representation of the s-expression representing the goal.

Definition at line 5699 of file z3py.py.

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

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

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

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

5707 def translate(self, target):
5708 """Copy goal `self` to context `target`.
5709
5710 >>> x = Int('x')
5711 >>> g = Goal()
5712 >>> g.add(x > 10)
5713 >>> g
5714 [x > 10]
5715 >>> c2 = Context()
5716 >>> g2 = g.translate(c2)
5717 >>> g2
5718 [x > 10]
5719 >>> g.ctx == main_ctx()
5720 True
5721 >>> g2.ctx == c2
5722 True
5723 >>> g2.ctx == main_ctx()
5724 False
5725 """
5726 if z3_debug():
5727 _z3_assert(isinstance(target, Context), "target must be a context")
5728 return Goal(goal=Z3_goal_translate(self.ctx.ref(), self.goal, target.ref()), ctx=target)
5729
z3py.main_ctx
def main_ctx()
Definition: z3py.py:238
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.

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 5489 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

Definition at line 5490 of file z3py.py.

Referenced by Goal.__del__(), Goal.assert_exprs(), Goal.convert_model(), Goal.depth(), Goal.dimacs(), Goal.get(), Goal.inconsistent(), Goal.prec(), Goal.sexpr(), Goal.size(), and Goal.translate().