Average Error: 0.1 → 0.1
Time: 17.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 r22715 = x;
        double r22716 = y;
        double r22717 = z;
        double r22718 = r22716 * r22717;
        double r22719 = r22718 * r22717;
        double r22720 = r22715 + r22719;
        return r22720;
}
↓
double f(double x, double y, double z) {
        double r22721 = x;
        double r22722 = y;
        double r22723 = z;
        double r22724 = r22722 * r22723;
        double r22725 = r22724 * r22723;
        double r22726 = r22721 + r22725;
        return r22726;
}

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