Average Error: 0.1 → 0.1
Time: 20.7s
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 r19890 = x;
        double r19891 = y;
        double r19892 = z;
        double r19893 = r19891 * r19892;
        double r19894 = r19893 * r19892;
        double r19895 = r19890 + r19894;
        return r19895;
}
↓
double f(double x, double y, double z) {
        double r19896 = x;
        double r19897 = y;
        double r19898 = z;
        double r19899 = r19897 * r19898;
        double r19900 = r19899 * r19898;
        double r19901 = r19896 + r19900;
        return r19901;
}

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