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