Average Error: 0.1 → 0.1
Time: 16.0s
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 r22441 = x;
        double r22442 = y;
        double r22443 = z;
        double r22444 = r22442 * r22443;
        double r22445 = r22444 * r22443;
        double r22446 = r22441 + r22445;
        return r22446;
}
↓
double f(double x, double y, double z) {
        double r22447 = x;
        double r22448 = y;
        double r22449 = z;
        double r22450 = r22448 * r22449;
        double r22451 = r22450 * r22449;
        double r22452 = r22447 + r22451;
        return r22452;
}

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