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 r23681 = x;
        double r23682 = y;
        double r23683 = z;
        double r23684 = r23682 * r23683;
        double r23685 = r23684 * r23683;
        double r23686 = r23681 + r23685;
        return r23686;
}
↓
double f(double x, double y, double z) {
        double r23687 = x;
        double r23688 = y;
        double r23689 = z;
        double r23690 = r23688 * r23689;
        double r23691 = r23690 * r23689;
        double r23692 = r23687 + r23691;
        return r23692;
}

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