Average Error: 0.1 → 0.1
Time: 2.9s
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 r14170 = x;
        double r14171 = y;
        double r14172 = z;
        double r14173 = r14171 * r14172;
        double r14174 = r14173 * r14172;
        double r14175 = r14170 + r14174;
        return r14175;
}
↓
double f(double x, double y, double z) {
        double r14176 = x;
        double r14177 = y;
        double r14178 = z;
        double r14179 = r14177 * r14178;
        double r14180 = r14179 * r14178;
        double r14181 = r14176 + r14180;
        return r14181;
}

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