Average Error: 0.1 → 0.1
Time: 3.6s
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 r16894 = x;
        double r16895 = y;
        double r16896 = z;
        double r16897 = r16895 * r16896;
        double r16898 = r16897 * r16896;
        double r16899 = r16894 + r16898;
        return r16899;
}
↓
double f(double x, double y, double z) {
        double r16900 = x;
        double r16901 = y;
        double r16902 = z;
        double r16903 = r16901 * r16902;
        double r16904 = r16903 * r16902;
        double r16905 = r16900 + r16904;
        return r16905;
}

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