Average Error: 0.1 → 0.1
Time: 12.7s
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 r14293 = x;
        double r14294 = y;
        double r14295 = z;
        double r14296 = r14294 * r14295;
        double r14297 = r14296 * r14295;
        double r14298 = r14293 + r14297;
        return r14298;
}
↓
double f(double x, double y, double z) {
        double r14299 = x;
        double r14300 = y;
        double r14301 = z;
        double r14302 = r14300 * r14301;
        double r14303 = r14302 * r14301;
        double r14304 = r14299 + r14303;
        return r14304;
}

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