Initial program 0.0
\[\left(x + 1\right) \cdot y - x
\]
Simplified0.0
\[\leadsto \color{blue}{\mathsf{fma}\left(x, y, y\right) - x}
\]
Proof
(-.f64 (fma.f64 x y y) x): 0 points increase in error, 0 points decrease in error
(-.f64 (Rewrite=> fma-udef_binary64 (+.f64 (*.f64 x y) y)) x): 1 points increase in error, 0 points decrease in error
(-.f64 (Rewrite=> distribute-lft1-in_binary64 (*.f64 (+.f64 x 1) y)) x): 3 points increase in error, 1 points decrease in error
Taylor expanded in x around 0 0.0
\[\leadsto \color{blue}{\left(y - 1\right) \cdot x + y}
\]
Simplified0.0
\[\leadsto \color{blue}{\mathsf{fma}\left(y, x, y - x\right)}
\]
Proof
(fma.f64 y x (-.f64 y x)): 0 points increase in error, 0 points decrease in error
(Rewrite<= fma-def_binary64 (+.f64 (*.f64 y x) (-.f64 y x))): 2 points increase in error, 0 points decrease in error
(+.f64 (*.f64 y x) (Rewrite<= unsub-neg_binary64 (+.f64 y (neg.f64 x)))): 0 points increase in error, 0 points decrease in error
(+.f64 (*.f64 y x) (+.f64 y (Rewrite<= mul-1-neg_binary64 (*.f64 -1 x)))): 0 points increase in error, 0 points decrease in error
(+.f64 (*.f64 y x) (Rewrite=> +-commutative_binary64 (+.f64 (*.f64 -1 x) y))): 0 points increase in error, 0 points decrease in error
(Rewrite<= associate-+l+_binary64 (+.f64 (+.f64 (*.f64 y x) (*.f64 -1 x)) y)): 0 points increase in error, 0 points decrease in error
(+.f64 (Rewrite<= distribute-rgt-in_binary64 (*.f64 x (+.f64 y -1))) y): 2 points increase in error, 0 points decrease in error
(+.f64 (*.f64 x (+.f64 y (Rewrite<= metadata-eval (neg.f64 1)))) y): 0 points increase in error, 0 points decrease in error
(+.f64 (*.f64 x (Rewrite<= sub-neg_binary64 (-.f64 y 1))) y): 0 points increase in error, 0 points decrease in error
(+.f64 (Rewrite<= *-commutative_binary64 (*.f64 (-.f64 y 1) x)) y): 0 points increase in error, 0 points decrease in error
Final simplification0.0
\[\leadsto \mathsf{fma}\left(y, x, y - x\right)
\]