Average Error: 0.1 → 0.1
Time: 3.6s
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 r16450 = x;
        double r16451 = y;
        double r16452 = z;
        double r16453 = r16451 * r16452;
        double r16454 = r16453 * r16452;
        double r16455 = r16450 + r16454;
        return r16455;
}
↓
double f(double x, double y, double z) {
        double r16456 = x;
        double r16457 = y;
        double r16458 = z;
        double r16459 = r16457 * r16458;
        double r16460 = r16459 * r16458;
        double r16461 = r16456 + r16460;
        return r16461;
}

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