Average Error: 0.1 → 0.1
Time: 3.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 r14335 = x;
        double r14336 = y;
        double r14337 = z;
        double r14338 = r14336 * r14337;
        double r14339 = r14338 * r14337;
        double r14340 = r14335 + r14339;
        return r14340;
}
↓
double f(double x, double y, double z) {
        double r14341 = x;
        double r14342 = y;
        double r14343 = z;
        double r14344 = r14342 * r14343;
        double r14345 = r14344 * r14343;
        double r14346 = r14341 + r14345;
        return r14346;
}

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