Average Error: 0.1 → 0.1
Time: 4.4s
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 r23724 = x;
        double r23725 = y;
        double r23726 = z;
        double r23727 = r23725 * r23726;
        double r23728 = r23727 * r23726;
        double r23729 = r23724 + r23728;
        return r23729;
}
↓
double f(double x, double y, double z) {
        double r23730 = x;
        double r23731 = y;
        double r23732 = z;
        double r23733 = r23731 * r23732;
        double r23734 = r23733 * r23732;
        double r23735 = r23730 + r23734;
        return r23735;
}

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