Initial program 0.0
\[x - y \cdot y
\]
Simplified0
\[\leadsto \color{blue}{\mathsf{fma}\left(y, -y, x\right)}
\]
Proof
(fma.f64 y (neg.f64 y) x): 0 points increase in error, 0 points decrease in error
(Rewrite<= fma-def_binary64 (+.f64 (*.f64 y (neg.f64 y)) x)): 1 points increase in error, 0 points decrease in error
(+.f64 (Rewrite<= *-commutative_binary64 (*.f64 (neg.f64 y) y)) x): 0 points increase in error, 0 points decrease in error
(Rewrite<= +-commutative_binary64 (+.f64 x (*.f64 (neg.f64 y) y))): 0 points increase in error, 0 points decrease in error
(Rewrite<= cancel-sign-sub-inv_binary64 (-.f64 x (*.f64 y y))): 0 points increase in error, 0 points decrease in error
Final simplification0
\[\leadsto \mathsf{fma}\left(y, -y, x\right)
\]