Average Error: 0.1 → 0.1
Time: 4.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 r21234 = x;
        double r21235 = y;
        double r21236 = z;
        double r21237 = r21235 * r21236;
        double r21238 = r21237 * r21236;
        double r21239 = r21234 + r21238;
        return r21239;
}
↓
double f(double x, double y, double z) {
        double r21240 = x;
        double r21241 = y;
        double r21242 = z;
        double r21243 = r21241 * r21242;
        double r21244 = r21243 * r21242;
        double r21245 = r21240 + r21244;
        return r21245;
}

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