Initial program 0.0
\[\left(\frac{x}{2} + y \cdot x\right) + z
\]
Simplified0.0
\[\leadsto \color{blue}{\frac{x}{2} + \mathsf{fma}\left(x, y, z\right)}
\]
Proof
(+.f64 (/.f64 x 2) (fma.f64 x y z)): 0 points increase in error, 0 points decrease in error
(+.f64 (/.f64 x 2) (Rewrite<= fma-def_binary64 (+.f64 (*.f64 x y) z))): 0 points increase in error, 0 points decrease in error
(+.f64 (/.f64 x 2) (+.f64 (Rewrite<= *-commutative_binary64 (*.f64 y x)) z)): 0 points increase in error, 0 points decrease in error
(Rewrite<= associate-+l+_binary64 (+.f64 (+.f64 (/.f64 x 2) (*.f64 y x)) z)): 0 points increase in error, 0 points decrease in error
Taylor expanded in x around 0 0.0
\[\leadsto \color{blue}{z + \left(0.5 + y\right) \cdot x}
\]
Simplified0.0
\[\leadsto \color{blue}{\mathsf{fma}\left(0.5 + y, x, z\right)}
\]
Proof
(fma.f64 (+.f64 1/2 y) x z): 0 points increase in error, 0 points decrease in error
(Rewrite<= fma-def_binary64 (+.f64 (*.f64 (+.f64 1/2 y) x) z)): 0 points increase in error, 0 points decrease in error
(Rewrite<= +-commutative_binary64 (+.f64 z (*.f64 (+.f64 1/2 y) x))): 0 points increase in error, 0 points decrease in error
Final simplification0.0
\[\leadsto \mathsf{fma}\left(0.5 + y, x, z\right)
\]