mirror of
https://github.com/Z3Prover/z3
synced 2025-08-26 13:06:05 +00:00
f6d411d54b
This update includes an experimental feature to access a congruence closure data-structure after search.
It comes with several caveats as pre-processing is free to eliminate terms. It is therefore necessary to use a solver that does not eliminate the terms you want to track for congruence of. This is partially addressed by using SimpleSolver or incremental mode solving.
```python
from z3 import *
s = SimpleSolver()
x, y, z = Ints('x y z')
s.add(x == y)
s.add(y == z)
s.check()
print(s.root(x), s.root(y), s.root(z))
print(s.next(x), s.next(y), s.next(z))
```
|
||
|---|---|---|
| .. | ||
| bounded_int2bv_solver.cpp | ||
| bounded_int2bv_solver.h | ||
| CMakeLists.txt | ||
| enum2bv_solver.cpp | ||
| enum2bv_solver.h | ||
| fd_solver.cpp | ||
| fd_solver.h | ||
| pb2bv_solver.cpp | ||
| pb2bv_solver.h | ||
| smtfd_solver.cpp | ||
| smtfd_solver.h | ||