Average Error: 0.1 → 0.1
Time: 7.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 r14878 = x;
        double r14879 = y;
        double r14880 = z;
        double r14881 = r14879 * r14880;
        double r14882 = r14881 * r14880;
        double r14883 = r14878 + r14882;
        return r14883;
}
↓
double f(double x, double y, double z) {
        double r14884 = x;
        double r14885 = y;
        double r14886 = z;
        double r14887 = r14885 * r14886;
        double r14888 = r14887 * r14886;
        double r14889 = r14884 + r14888;
        return r14889;
}

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