Average Error: 0.1 → 0.1
Time: 40.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 r23566 = x;
        double r23567 = y;
        double r23568 = z;
        double r23569 = r23567 * r23568;
        double r23570 = r23569 * r23568;
        double r23571 = r23566 + r23570;
        return r23571;
}
↓
double f(double x, double y, double z) {
        double r23572 = x;
        double r23573 = y;
        double r23574 = z;
        double r23575 = r23573 * r23574;
        double r23576 = r23575 * r23574;
        double r23577 = r23572 + r23576;
        return r23577;
}

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