Average Error: 0.1 → 0.1
Time: 12.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 r33312 = x;
        double r33313 = y;
        double r33314 = z;
        double r33315 = r33313 * r33314;
        double r33316 = r33315 * r33314;
        double r33317 = r33312 + r33316;
        return r33317;
}
↓
double f(double x, double y, double z) {
        double r33318 = x;
        double r33319 = y;
        double r33320 = z;
        double r33321 = r33319 * r33320;
        double r33322 = r33321 * r33320;
        double r33323 = r33318 + r33322;
        return r33323;
}

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