Average Error: 0.1 → 0.1
Time: 4.2s
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 r21062 = x;
        double r21063 = y;
        double r21064 = z;
        double r21065 = r21063 * r21064;
        double r21066 = r21065 * r21064;
        double r21067 = r21062 + r21066;
        return r21067;
}
↓
double f(double x, double y, double z) {
        double r21068 = x;
        double r21069 = y;
        double r21070 = z;
        double r21071 = r21069 * r21070;
        double r21072 = r21071 * r21070;
        double r21073 = r21068 + r21072;
        return r21073;
}

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