Average Error: 0.1 → 0.1
Time: 20.3s
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 r12770 = x;
        double r12771 = y;
        double r12772 = z;
        double r12773 = r12771 * r12772;
        double r12774 = r12773 * r12772;
        double r12775 = r12770 + r12774;
        return r12775;
}
↓
double f(double x, double y, double z) {
        double r12776 = x;
        double r12777 = y;
        double r12778 = z;
        double r12779 = r12777 * r12778;
        double r12780 = r12779 * r12778;
        double r12781 = r12776 + r12780;
        return r12781;
}

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