Average Error: 0.1 → 0.1
Time: 11.2s
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 r22614 = x;
        double r22615 = y;
        double r22616 = z;
        double r22617 = r22615 * r22616;
        double r22618 = r22617 * r22616;
        double r22619 = r22614 + r22618;
        return r22619;
}
↓
double f(double x, double y, double z) {
        double r22620 = x;
        double r22621 = y;
        double r22622 = z;
        double r22623 = r22621 * r22622;
        double r22624 = r22623 * r22622;
        double r22625 = r22620 + r22624;
        return r22625;
}

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