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 r17833 = x;
        double r17834 = y;
        double r17835 = z;
        double r17836 = r17834 * r17835;
        double r17837 = r17836 * r17835;
        double r17838 = r17833 + r17837;
        return r17838;
}
↓
double f(double x, double y, double z) {
        double r17839 = x;
        double r17840 = y;
        double r17841 = z;
        double r17842 = r17840 * r17841;
        double r17843 = r17842 * r17841;
        double r17844 = r17839 + r17843;
        return r17844;
}

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)))