Average Error: 0.1 → 0.1
Time: 2.3s
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 r12054 = x;
        double r12055 = y;
        double r12056 = z;
        double r12057 = r12055 * r12056;
        double r12058 = r12057 * r12056;
        double r12059 = r12054 + r12058;
        return r12059;
}
↓
double f(double x, double y, double z) {
        double r12060 = x;
        double r12061 = y;
        double r12062 = z;
        double r12063 = r12061 * r12062;
        double r12064 = r12063 * r12062;
        double r12065 = r12060 + r12064;
        return r12065;
}

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