Average Error: 0.1 → 0.1
Time: 3.5s
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 r14841 = x;
        double r14842 = y;
        double r14843 = z;
        double r14844 = r14842 * r14843;
        double r14845 = r14844 * r14843;
        double r14846 = r14841 + r14845;
        return r14846;
}
↓
double f(double x, double y, double z) {
        double r14847 = x;
        double r14848 = y;
        double r14849 = z;
        double r14850 = r14848 * r14849;
        double r14851 = r14850 * r14849;
        double r14852 = r14847 + r14851;
        return r14852;
}

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