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 r14289 = x;
        double r14290 = y;
        double r14291 = z;
        double r14292 = r14290 * r14291;
        double r14293 = r14292 * r14291;
        double r14294 = r14289 + r14293;
        return r14294;
}
↓
double f(double x, double y, double z) {
        double r14295 = x;
        double r14296 = y;
        double r14297 = z;
        double r14298 = r14296 * r14297;
        double r14299 = r14298 * r14297;
        double r14300 = r14295 + r14299;
        return r14300;
}

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