Average Error: 0.1 → 0.1
Time: 10.1s
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 r16220 = x;
        double r16221 = y;
        double r16222 = z;
        double r16223 = r16221 * r16222;
        double r16224 = r16223 * r16222;
        double r16225 = r16220 + r16224;
        return r16225;
}
↓
double f(double x, double y, double z) {
        double r16226 = x;
        double r16227 = y;
        double r16228 = z;
        double r16229 = r16227 * r16228;
        double r16230 = r16229 * r16228;
        double r16231 = r16226 + r16230;
        return r16231;
}

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)))