Average Error: 0.1 → 0.1
Time: 3.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 r14175 = x;
        double r14176 = y;
        double r14177 = z;
        double r14178 = r14176 * r14177;
        double r14179 = r14178 * r14177;
        double r14180 = r14175 + r14179;
        return r14180;
}
↓
double f(double x, double y, double z) {
        double r14181 = x;
        double r14182 = y;
        double r14183 = z;
        double r14184 = r14182 * r14183;
        double r14185 = r14184 * r14183;
        double r14186 = r14181 + r14185;
        return r14186;
}

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