Average Error: 0.1 → 0.1
Time: 1.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 r6369 = x;
        double r6370 = y;
        double r6371 = z;
        double r6372 = r6370 * r6371;
        double r6373 = r6372 * r6371;
        double r6374 = r6369 + r6373;
        return r6374;
}
↓
double f(double x, double y, double z) {
        double r6375 = x;
        double r6376 = y;
        double r6377 = z;
        double r6378 = r6376 * r6377;
        double r6379 = r6378 * r6377;
        double r6380 = r6375 + r6379;
        return r6380;
}

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