Average Error: 0.1 → 0.1
Time: 20.1s
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 r22160 = x;
        double r22161 = y;
        double r22162 = z;
        double r22163 = r22161 * r22162;
        double r22164 = r22163 * r22162;
        double r22165 = r22160 + r22164;
        return r22165;
}
↓
double f(double x, double y, double z) {
        double r22166 = x;
        double r22167 = y;
        double r22168 = z;
        double r22169 = r22167 * r22168;
        double r22170 = r22169 * r22168;
        double r22171 = r22166 + r22170;
        return r22171;
}

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