Average Error: 0.1 → 0.1
Time: 4.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 r25215 = x;
        double r25216 = y;
        double r25217 = z;
        double r25218 = r25216 * r25217;
        double r25219 = r25218 * r25217;
        double r25220 = r25215 + r25219;
        return r25220;
}
↓
double f(double x, double y, double z) {
        double r25221 = x;
        double r25222 = y;
        double r25223 = z;
        double r25224 = r25222 * r25223;
        double r25225 = r25224 * r25223;
        double r25226 = r25221 + r25225;
        return r25226;
}

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