Average Error: 0.1 → 0.1
Time: 6.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 r24995 = x;
        double r24996 = y;
        double r24997 = z;
        double r24998 = r24996 * r24997;
        double r24999 = r24998 * r24997;
        double r25000 = r24995 + r24999;
        return r25000;
}
↓
double f(double x, double y, double z) {
        double r25001 = x;
        double r25002 = y;
        double r25003 = z;
        double r25004 = r25002 * r25003;
        double r25005 = r25004 * r25003;
        double r25006 = r25001 + r25005;
        return r25006;
}

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