Average Error: 0.1 → 0.1
Time: 3.0s
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 r13228 = x;
        double r13229 = y;
        double r13230 = z;
        double r13231 = r13229 * r13230;
        double r13232 = r13231 * r13230;
        double r13233 = r13228 + r13232;
        return r13233;
}
↓
double f(double x, double y, double z) {
        double r13234 = x;
        double r13235 = y;
        double r13236 = z;
        double r13237 = r13235 * r13236;
        double r13238 = r13237 * r13236;
        double r13239 = r13234 + r13238;
        return r13239;
}

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