Average Error: 0.1 → 0.1
Time: 3.7s
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 r19484 = x;
        double r19485 = y;
        double r19486 = z;
        double r19487 = r19485 * r19486;
        double r19488 = r19487 * r19486;
        double r19489 = r19484 + r19488;
        return r19489;
}
↓
double f(double x, double y, double z) {
        double r19490 = x;
        double r19491 = y;
        double r19492 = z;
        double r19493 = r19491 * r19492;
        double r19494 = r19493 * r19492;
        double r19495 = r19490 + r19494;
        return r19495;
}

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