Average Error: 0.1 → 0.1
Time: 4.2s
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 r21188 = x;
        double r21189 = y;
        double r21190 = z;
        double r21191 = r21189 * r21190;
        double r21192 = r21191 * r21190;
        double r21193 = r21188 + r21192;
        return r21193;
}
↓
double f(double x, double y, double z) {
        double r21194 = x;
        double r21195 = y;
        double r21196 = z;
        double r21197 = r21195 * r21196;
        double r21198 = r21197 * r21196;
        double r21199 = r21194 + r21198;
        return r21199;
}

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