Average Error: 0.0 → 0.0
Time: 798.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 r109371 = x;
        double r109372 = y;
        double r109373 = z;
        double r109374 = r109373 + r109371;
        double r109375 = r109372 * r109374;
        double r109376 = r109371 + r109375;
        return r109376;
}

double f(double x, double y, double z) {
        double r109377 = y;
        double r109378 = z;
        double r109379 = x;
        double r109380 = fma(r109377, r109379, r109379);
        double r109381 = fma(r109377, r109378, r109380);
        return r109381;
}

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 2020001 +o rules:numerics
(FPCore (x y z)
  :name "Main:bigenough2 from A"
  :precision binary64
  (+ x (* y (+ z x))))