mirror of
https://github.com/Z3Prover/z3
synced 2026-05-01 08:03:45 +00:00
add more doc
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
parent
5a5758baaa
commit
90ba225ae3
2 changed files with 62 additions and 5 deletions
|
|
@ -13,7 +13,37 @@ Author:
|
|||
|
||||
Leonardo (leonardo) 2011-11-20
|
||||
|
||||
Notes:
|
||||
Tactic Documentation:
|
||||
|
||||
## Tactic simplify
|
||||
|
||||
### Short Description:
|
||||
|
||||
The tactic performs algebraic simplifcations on formulas
|
||||
|
||||
### Long Description
|
||||
|
||||
The simplify tactic invokes z3's main rewriting engine.
|
||||
The rewriting engine contains support for theory specific simplifications.
|
||||
The set of simplifications invoked is open ended. Useful algebraic simplifications
|
||||
are added to the rewrite engine as they are discovered to be useful.
|
||||
|
||||
Note that the simplifier does not ensure that equivalent formulas are simplified to the same form.
|
||||
In other words it does not guarantee canonicity. This contrasts with BDD packages where BDDs constructed
|
||||
from two equivalent formulas are guaranteed to be equal.
|
||||
|
||||
### Example
|
||||
|
||||
```z3
|
||||
(declare-const x Int)
|
||||
(declare-const y Int)
|
||||
(assert (> x (+ x y)))
|
||||
(apply simplify)
|
||||
```
|
||||
|
||||
### Notes
|
||||
|
||||
* supports unsat cores, proof terms
|
||||
|
||||
--*/
|
||||
#pragma once
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue