Average Error: 0.1 → 0.1
Time: 17.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 r23164 = x;
        double r23165 = y;
        double r23166 = z;
        double r23167 = r23165 * r23166;
        double r23168 = r23167 * r23166;
        double r23169 = r23164 + r23168;
        return r23169;
}
↓
double f(double x, double y, double z) {
        double r23170 = x;
        double r23171 = y;
        double r23172 = z;
        double r23173 = r23171 * r23172;
        double r23174 = r23173 * r23172;
        double r23175 = r23170 + r23174;
        return r23175;
}

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