Average Error: 0.1 → 0.1
Time: 4.6s
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 r28450 = x;
        double r28451 = y;
        double r28452 = z;
        double r28453 = r28451 * r28452;
        double r28454 = r28453 * r28452;
        double r28455 = r28450 + r28454;
        return r28455;
}
↓
double f(double x, double y, double z) {
        double r28456 = x;
        double r28457 = y;
        double r28458 = z;
        double r28459 = r28457 * r28458;
        double r28460 = r28459 * r28458;
        double r28461 = r28456 + r28460;
        return r28461;
}

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