Average Error: 0.1 → 0.1
Time: 3.5s
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 r14608 = x;
        double r14609 = y;
        double r14610 = z;
        double r14611 = r14609 * r14610;
        double r14612 = r14611 * r14610;
        double r14613 = r14608 + r14612;
        return r14613;
}
↓
double f(double x, double y, double z) {
        double r14614 = x;
        double r14615 = y;
        double r14616 = z;
        double r14617 = r14615 * r14616;
        double r14618 = r14617 * r14616;
        double r14619 = r14614 + r14618;
        return r14619;
}

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