Average Error: 0.1 → 0.1
Time: 2.7s
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 r10461 = x;
        double r10462 = y;
        double r10463 = z;
        double r10464 = r10462 * r10463;
        double r10465 = r10464 * r10463;
        double r10466 = r10461 + r10465;
        return r10466;
}
↓
double f(double x, double y, double z) {
        double r10467 = x;
        double r10468 = y;
        double r10469 = z;
        double r10470 = r10468 * r10469;
        double r10471 = r10470 * r10469;
        double r10472 = r10467 + r10471;
        return r10472;
}

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