Average Error: 0.1 → 0.1
Time: 3.8s
Precision: 64
\[x + \left(y \cdot z\right) \cdot z\]
↓
\[x + \left(y \cdot z\right) \cdot z\]
x + \left(y \cdot z\right) \cdot z
↓
x + \left(y \cdot z\right) \cdot z
double f(double x, double y, double z) {
        double r17385 = x;
        double r17386 = y;
        double r17387 = z;
        double r17388 = r17386 * r17387;
        double r17389 = r17388 * r17387;
        double r17390 = r17385 + r17389;
        return r17390;
}
↓
double f(double x, double y, double z) {
        double r17391 = x;
        double r17392 = y;
        double r17393 = z;
        double r17394 = r17392 * r17393;
        double r17395 = r17394 * r17393;
        double r17396 = r17391 + r17395;
        return r17396;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

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

  2. Final simplification0.1

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

Reproduce

herbie shell --seed 2019347 +o rules:numerics
(FPCore (x y z)
  :name "Statistics.Sample:robustSumVarWeighted from math-functions-0.1.5.2"
  :precision binary64
  (+ x (* (* y z) z)))