3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-08-03 18:00:23 +00:00
z3/src/tactic/fd_solver
Nikolaj Bjorner f6d411d54b experimental feature to access congruence closure of SimpleSolver
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))
```
2022-12-30 21:41:27 -08:00
..
bounded_int2bv_solver.cpp experimental feature to access congruence closure of SimpleSolver 2022-12-30 21:41:27 -08:00
bounded_int2bv_solver.h booyah 2020-07-04 15:56:30 -07:00
CMakeLists.txt SMTFD is back (#4676) 2020-09-04 10:50:35 -07:00
enum2bv_solver.cpp experimental feature to access congruence closure of SimpleSolver 2022-12-30 21:41:27 -08:00
enum2bv_solver.h booyah 2020-07-04 15:56:30 -07:00
fd_solver.cpp more consistent use of parallel mode when enabled, takes care of example test from #1898 that didn't trigger parallel mode 2018-11-02 18:44:53 -05:00
fd_solver.h booyah 2020-07-04 15:56:30 -07:00
pb2bv_solver.cpp experimental feature to access congruence closure of SimpleSolver 2022-12-30 21:41:27 -08:00
pb2bv_solver.h booyah 2020-07-04 15:56:30 -07:00
smtfd_solver.cpp experimental feature to access congruence closure of SimpleSolver 2022-12-30 21:41:27 -08:00
smtfd_solver.h SMTFD is back (#4676) 2020-09-04 10:50:35 -07:00