Average Error: 0.1 → 0.1
Time: 4.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 r25309 = x;
        double r25310 = y;
        double r25311 = z;
        double r25312 = r25310 * r25311;
        double r25313 = r25312 * r25311;
        double r25314 = r25309 + r25313;
        return r25314;
}
↓
double f(double x, double y, double z) {
        double r25315 = x;
        double r25316 = y;
        double r25317 = z;
        double r25318 = r25316 * r25317;
        double r25319 = r25318 * r25317;
        double r25320 = r25315 + r25319;
        return r25320;
}

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