Average Error: 0.1 → 0.1
Time: 7.9s
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 r11210 = x;
        double r11211 = y;
        double r11212 = z;
        double r11213 = r11211 * r11212;
        double r11214 = r11213 * r11212;
        double r11215 = r11210 + r11214;
        return r11215;
}
↓
double f(double x, double y, double z) {
        double r11216 = x;
        double r11217 = y;
        double r11218 = z;
        double r11219 = r11217 * r11218;
        double r11220 = r11219 * r11218;
        double r11221 = r11216 + r11220;
        return r11221;
}

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)))