Average Error: 0.1 → 0.1
Time: 3.9s
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 r18662 = x;
        double r18663 = y;
        double r18664 = z;
        double r18665 = r18663 * r18664;
        double r18666 = r18665 * r18664;
        double r18667 = r18662 + r18666;
        return r18667;
}
↓
double f(double x, double y, double z) {
        double r18668 = x;
        double r18669 = y;
        double r18670 = z;
        double r18671 = r18669 * r18670;
        double r18672 = r18671 * r18670;
        double r18673 = r18668 + r18672;
        return r18673;
}

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