Average Error: 0.1 → 0.1
Time: 6.2s
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 r24241 = x;
        double r24242 = y;
        double r24243 = z;
        double r24244 = r24242 * r24243;
        double r24245 = r24244 * r24243;
        double r24246 = r24241 + r24245;
        return r24246;
}
↓
double f(double x, double y, double z) {
        double r24247 = x;
        double r24248 = y;
        double r24249 = z;
        double r24250 = r24248 * r24249;
        double r24251 = r24250 * r24249;
        double r24252 = r24247 + r24251;
        return r24252;
}

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