Average Error: 0.0 → 0.0
Time: 993.0ms
Precision: 64
\[x + y \cdot \left(z + x\right)\]
↓
\[\mathsf{fma}\left(y, z, \mathsf{fma}\left(y, x, x\right)\right)\]
x + y \cdot \left(z + x\right)
↓
\mathsf{fma}\left(y, z, \mathsf{fma}\left(y, x, x\right)\right)
double f(double x, double y, double z) {
        double r130518 = x;
        double r130519 = y;
        double r130520 = z;
        double r130521 = r130520 + r130518;
        double r130522 = r130519 * r130521;
        double r130523 = r130518 + r130522;
        return r130523;
}
↓
double f(double x, double y, double z) {
        double r130524 = y;
        double r130525 = z;
        double r130526 = x;
        double r130527 = fma(r130524, r130526, r130526);
        double r130528 = fma(r130524, r130525, r130527);
        return r130528;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Derivation

  1. Initial program 0.0

    \[x + y \cdot \left(z + x\right)\]

  2. Simplified0.0

    \[\leadsto \color{blue}{\mathsf{fma}\left(y, z + x, x\right)}\]

  3. Taylor expanded around 0 0.0

    \[\leadsto \color{blue}{z \cdot y + \left(x + x \cdot y\right)}\]

  4. Simplified0.0

    \[\leadsto \color{blue}{\mathsf{fma}\left(y, z, \mathsf{fma}\left(y, x, x\right)\right)}\]

  5. Final simplification0.0

    \[\leadsto \mathsf{fma}\left(y, z, \mathsf{fma}\left(y, x, x\right)\right)\]

Reproduce

herbie shell --seed 2019353 +o rules:numerics
(FPCore (x y z)
  :name "Main:bigenough2 from A"
  :precision binary64
  (+ x (* y (+ z x))))