Many compilers, synthesizers, and theorem provers rely on rewrite rules to simplify expressions or prove equivalences. Developing can be difficult: may subtly incorrect, profitable are easy miss, rulesets must rechecked extended whenever semantics tweaked. Large also challenging apply: redundant slow down rule-based search frustrate debugging. This paper explores how equality saturation, a prom...