Average Error: 0.1 → 0.1
Time: 3.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 r14645 = x;
        double r14646 = y;
        double r14647 = z;
        double r14648 = r14646 * r14647;
        double r14649 = r14648 * r14647;
        double r14650 = r14645 + r14649;
        return r14650;
}
↓
double f(double x, double y, double z) {
        double r14651 = x;
        double r14652 = y;
        double r14653 = z;
        double r14654 = r14652 * r14653;
        double r14655 = r14654 * r14653;
        double r14656 = r14651 + r14655;
        return r14656;
}

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