Average Error: 0.1 → 0.1
Time: 3.4s
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 r15317 = x;
        double r15318 = y;
        double r15319 = z;
        double r15320 = r15318 * r15319;
        double r15321 = r15320 * r15319;
        double r15322 = r15317 + r15321;
        return r15322;
}
↓
double f(double x, double y, double z) {
        double r15323 = x;
        double r15324 = y;
        double r15325 = z;
        double r15326 = r15324 * r15325;
        double r15327 = r15326 * r15325;
        double r15328 = r15323 + r15327;
        return r15328;
}

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