Average Error: 0.1 → 0.1
Time: 20.2s
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 r30169 = x;
        double r30170 = y;
        double r30171 = z;
        double r30172 = r30170 * r30171;
        double r30173 = r30172 * r30171;
        double r30174 = r30169 + r30173;
        return r30174;
}
↓
double f(double x, double y, double z) {
        double r30175 = x;
        double r30176 = y;
        double r30177 = z;
        double r30178 = r30176 * r30177;
        double r30179 = r30178 * r30177;
        double r30180 = r30175 + r30179;
        return r30180;
}

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