Average Error: 0.1 → 0.1
Time: 3.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 r14727 = x;
        double r14728 = y;
        double r14729 = z;
        double r14730 = r14728 * r14729;
        double r14731 = r14730 * r14729;
        double r14732 = r14727 + r14731;
        return r14732;
}
↓
double f(double x, double y, double z) {
        double r14733 = x;
        double r14734 = y;
        double r14735 = z;
        double r14736 = r14734 * r14735;
        double r14737 = r14736 * r14735;
        double r14738 = r14733 + r14737;
        return r14738;
}

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