Average Error: 0.1 → 0.1
Time: 4.5s
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 r22368 = x;
        double r22369 = y;
        double r22370 = z;
        double r22371 = r22369 * r22370;
        double r22372 = r22371 * r22370;
        double r22373 = r22368 + r22372;
        return r22373;
}
↓
double f(double x, double y, double z) {
        double r22374 = x;
        double r22375 = y;
        double r22376 = z;
        double r22377 = r22375 * r22376;
        double r22378 = r22377 * r22376;
        double r22379 = r22374 + r22378;
        return r22379;
}

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