Average Error: 0.1 → 0.1
Time: 3.7s
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 r17333 = x;
        double r17334 = y;
        double r17335 = z;
        double r17336 = r17334 * r17335;
        double r17337 = r17336 * r17335;
        double r17338 = r17333 + r17337;
        return r17338;
}
↓
double f(double x, double y, double z) {
        double r17339 = x;
        double r17340 = y;
        double r17341 = z;
        double r17342 = r17340 * r17341;
        double r17343 = r17342 * r17341;
        double r17344 = r17339 + r17343;
        return r17344;
}

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