Average Error: 0.1 → 0.1
Time: 8.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 r12244 = x;
        double r12245 = y;
        double r12246 = z;
        double r12247 = r12245 * r12246;
        double r12248 = r12247 * r12246;
        double r12249 = r12244 + r12248;
        return r12249;
}
↓
double f(double x, double y, double z) {
        double r12250 = x;
        double r12251 = y;
        double r12252 = z;
        double r12253 = r12251 * r12252;
        double r12254 = r12253 * r12252;
        double r12255 = r12250 + r12254;
        return r12255;
}

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