Average Error: 0.0 → 0.0
Time: 920.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 r107133 = x;
        double r107134 = y;
        double r107135 = z;
        double r107136 = r107135 + r107133;
        double r107137 = r107134 * r107136;
        double r107138 = r107133 + r107137;
        return r107138;
}
↓
double f(double x, double y, double z) {
        double r107139 = y;
        double r107140 = z;
        double r107141 = x;
        double r107142 = fma(r107139, r107141, r107141);
        double r107143 = fma(r107139, r107140, r107142);
        return r107143;
}

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