Average Error: 0.1 → 0.1
Time: 9.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 r19058 = x;
        double r19059 = y;
        double r19060 = z;
        double r19061 = r19059 * r19060;
        double r19062 = r19061 * r19060;
        double r19063 = r19058 + r19062;
        return r19063;
}
↓
double f(double x, double y, double z) {
        double r19064 = x;
        double r19065 = y;
        double r19066 = z;
        double r19067 = r19065 * r19066;
        double r19068 = r19067 * r19066;
        double r19069 = r19064 + r19068;
        return r19069;
}

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. Simplified0.1

    \[\leadsto \color{blue}{x + z \cdot \left(z \cdot y\right)}\]

  3. Final simplification0.1

    \[\leadsto x + \left(y \cdot z\right) \cdot z\]

Reproduce

herbie shell --seed 2019195 
(FPCore (x y z)
  :name "Statistics.Sample:robustSumVarWeighted from math-functions-0.1.5.2"
  (+ x (* (* y z) z)))