Average Error: 0.1 → 0.1
Time: 4.4s
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 r25340 = x;
        double r25341 = y;
        double r25342 = z;
        double r25343 = r25341 * r25342;
        double r25344 = r25343 * r25342;
        double r25345 = r25340 + r25344;
        return r25345;
}
↓
double f(double x, double y, double z) {
        double r25346 = x;
        double r25347 = y;
        double r25348 = z;
        double r25349 = r25347 * r25348;
        double r25350 = r25349 * r25348;
        double r25351 = r25346 + r25350;
        return r25351;
}

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