Average Error: 0.1 → 0.1
Time: 15.6s
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 r33343 = x;
        double r33344 = y;
        double r33345 = z;
        double r33346 = r33344 * r33345;
        double r33347 = r33346 * r33345;
        double r33348 = r33343 + r33347;
        return r33348;
}
↓
double f(double x, double y, double z) {
        double r33349 = x;
        double r33350 = y;
        double r33351 = z;
        double r33352 = r33350 * r33351;
        double r33353 = r33352 * r33351;
        double r33354 = r33349 + r33353;
        return r33354;
}

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