Average Error: 0.1 → 0.1
Time: 40.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 r23248 = x;
        double r23249 = y;
        double r23250 = z;
        double r23251 = r23249 * r23250;
        double r23252 = r23251 * r23250;
        double r23253 = r23248 + r23252;
        return r23253;
}
↓
double f(double x, double y, double z) {
        double r23254 = x;
        double r23255 = y;
        double r23256 = z;
        double r23257 = r23255 * r23256;
        double r23258 = r23257 * r23256;
        double r23259 = r23254 + r23258;
        return r23259;
}

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