Average Error: 0.1 → 0.1
Time: 10.2s
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 r8704 = x;
        double r8705 = y;
        double r8706 = z;
        double r8707 = r8705 * r8706;
        double r8708 = r8707 * r8706;
        double r8709 = r8704 + r8708;
        return r8709;
}
↓
double f(double x, double y, double z) {
        double r8710 = x;
        double r8711 = y;
        double r8712 = z;
        double r8713 = r8711 * r8712;
        double r8714 = r8713 * r8712;
        double r8715 = r8710 + r8714;
        return r8715;
}

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