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