Initial program 0.0
\[\left(x \cdot y + z \cdot t\right) + a \cdot b
\]
Taylor expanded in x around 0 0.0
\[\leadsto \color{blue}{a \cdot b + \left(y \cdot x + t \cdot z\right)}
\]
Simplified0.0
\[\leadsto \color{blue}{\mathsf{fma}\left(a, b, \mathsf{fma}\left(t, z, y \cdot x\right)\right)}
\]
Proof
(fma.f64 a b (fma.f64 t z (*.f64 y x))): 0 points increase in error, 0 points decrease in error
(fma.f64 a b (fma.f64 t z (Rewrite=> *-commutative_binary64 (*.f64 x y)))): 0 points increase in error, 0 points decrease in error
(fma.f64 a b (Rewrite=> fma-udef_binary64 (+.f64 (*.f64 t z) (*.f64 x y)))): 0 points increase in error, 0 points decrease in error
(fma.f64 a b (+.f64 (*.f64 t z) (Rewrite<= *-commutative_binary64 (*.f64 y x)))): 0 points increase in error, 0 points decrease in error
(fma.f64 a b (Rewrite<= +-commutative_binary64 (+.f64 (*.f64 y x) (*.f64 t z)))): 0 points increase in error, 0 points decrease in error
(Rewrite<= fma-def_binary64 (+.f64 (*.f64 a b) (+.f64 (*.f64 y x) (*.f64 t z)))): 0 points increase in error, 0 points decrease in error
Final simplification0.0
\[\leadsto \mathsf{fma}\left(a, b, \mathsf{fma}\left(t, z, y \cdot x\right)\right)
\]