Average Error: 0.1 → 0.1
Time: 11.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 r30951 = x;
        double r30952 = y;
        double r30953 = z;
        double r30954 = r30952 * r30953;
        double r30955 = r30954 * r30953;
        double r30956 = r30951 + r30955;
        return r30956;
}
↓
double f(double x, double y, double z) {
        double r30957 = x;
        double r30958 = y;
        double r30959 = z;
        double r30960 = r30958 * r30959;
        double r30961 = r30960 * r30959;
        double r30962 = r30957 + r30961;
        return r30962;
}

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