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 r14628 = x;
        double r14629 = y;
        double r14630 = z;
        double r14631 = r14629 * r14630;
        double r14632 = r14631 * r14630;
        double r14633 = r14628 + r14632;
        return r14633;
}
↓
double f(double x, double y, double z) {
        double r14634 = x;
        double r14635 = y;
        double r14636 = z;
        double r14637 = r14635 * r14636;
        double r14638 = r14637 * r14636;
        double r14639 = r14634 + r14638;
        return r14639;
}

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