Average Error: 0.1 → 0.1
Time: 4.4s
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 r21595 = x;
        double r21596 = y;
        double r21597 = z;
        double r21598 = r21596 * r21597;
        double r21599 = r21598 * r21597;
        double r21600 = r21595 + r21599;
        return r21600;
}
↓
double f(double x, double y, double z) {
        double r21601 = x;
        double r21602 = y;
        double r21603 = z;
        double r21604 = r21602 * r21603;
        double r21605 = r21604 * r21603;
        double r21606 = r21601 + r21605;
        return r21606;
}

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 2020062 +o rules:numerics
(FPCore (x y z)
  :name "Statistics.Sample:robustSumVarWeighted from math-functions-0.1.5.2"
  :precision binary64
  (+ x (* (* y z) z)))