Average Error: 0.1 → 0.1
Time: 3.5s
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 r14230 = x;
        double r14231 = y;
        double r14232 = z;
        double r14233 = r14231 * r14232;
        double r14234 = r14233 * r14232;
        double r14235 = r14230 + r14234;
        return r14235;
}
↓
double f(double x, double y, double z) {
        double r14236 = x;
        double r14237 = y;
        double r14238 = z;
        double r14239 = r14237 * r14238;
        double r14240 = r14239 * r14238;
        double r14241 = r14236 + r14240;
        return r14241;
}

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