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 r15282 = x;
        double r15283 = y;
        double r15284 = z;
        double r15285 = r15283 * r15284;
        double r15286 = r15285 * r15284;
        double r15287 = r15282 + r15286;
        return r15287;
}
↓
double f(double x, double y, double z) {
        double r15288 = x;
        double r15289 = y;
        double r15290 = z;
        double r15291 = r15289 * r15290;
        double r15292 = r15291 * r15290;
        double r15293 = r15288 + r15292;
        return r15293;
}

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