Initial program 0.2
\[\left(x \cdot x\right) \cdot \left(3 - x \cdot 2\right)
\]
Simplified0.2
\[\leadsto \color{blue}{x \cdot \left(x \cdot \mathsf{fma}\left(x, -2, 3\right)\right)}
\]
Proof
(*.f64 x (*.f64 x (fma.f64 x -2 3))): 0 points increase in error, 0 points decrease in error
(*.f64 x (*.f64 x (fma.f64 x (Rewrite<= metadata-eval (neg.f64 2)) 3))): 0 points increase in error, 0 points decrease in error
(*.f64 x (*.f64 x (Rewrite<= fma-def_binary64 (+.f64 (*.f64 x (neg.f64 2)) 3)))): 0 points increase in error, 0 points decrease in error
(*.f64 x (*.f64 x (+.f64 (Rewrite<= distribute-rgt-neg-in_binary64 (neg.f64 (*.f64 x 2))) 3))): 0 points increase in error, 0 points decrease in error
(*.f64 x (*.f64 x (+.f64 (Rewrite<= distribute-lft-neg-out_binary64 (*.f64 (neg.f64 x) 2)) 3))): 0 points increase in error, 0 points decrease in error
(*.f64 x (*.f64 x (Rewrite<= +-commutative_binary64 (+.f64 3 (*.f64 (neg.f64 x) 2))))): 0 points increase in error, 0 points decrease in error
(*.f64 x (*.f64 x (Rewrite<= cancel-sign-sub-inv_binary64 (-.f64 3 (*.f64 x 2))))): 0 points increase in error, 0 points decrease in error
(Rewrite<= associate-*l*_binary64 (*.f64 (*.f64 x x) (-.f64 3 (*.f64 x 2)))): 26 points increase in error, 15 points decrease in error
Applied egg-rr0.2
\[\leadsto x \cdot \color{blue}{\left(\left(x \cdot -2\right) \cdot x + 3 \cdot x\right)}
\]
Applied egg-rr0.2
\[\leadsto x \cdot \color{blue}{\mathsf{fma}\left(x, 3, x \cdot \left(x \cdot -2\right)\right)}
\]
Final simplification0.2
\[\leadsto x \cdot \mathsf{fma}\left(x, 3, x \cdot \left(x \cdot -2\right)\right)
\]