Average Error: 0.1 → 0.1
Time: 7.8s
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 r15613 = x;
        double r15614 = y;
        double r15615 = z;
        double r15616 = r15614 * r15615;
        double r15617 = r15616 * r15615;
        double r15618 = r15613 + r15617;
        return r15618;
}
↓
double f(double x, double y, double z) {
        double r15619 = x;
        double r15620 = y;
        double r15621 = z;
        double r15622 = r15620 * r15621;
        double r15623 = r15622 * r15621;
        double r15624 = r15619 + r15623;
        return r15624;
}

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