Average Error: 0.1 → 0.1
Time: 3.8s
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 r18334 = x;
        double r18335 = y;
        double r18336 = z;
        double r18337 = r18335 * r18336;
        double r18338 = r18337 * r18336;
        double r18339 = r18334 + r18338;
        return r18339;
}
↓
double f(double x, double y, double z) {
        double r18340 = x;
        double r18341 = y;
        double r18342 = z;
        double r18343 = r18341 * r18342;
        double r18344 = r18343 * r18342;
        double r18345 = r18340 + r18344;
        return r18345;
}

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