This is an experimental equality saturation engine written in python. It works with more or less arbitrary finite signatures and sets of rewriting rules. It also supports explanations (not perfectly though). Its main goal is to support machine learning so that it is possible to learn rewriting strategies (this part is not implemented yet).

• Naive boolean term minimization
• Less naive boolean term minimization