Average Error: 0.1 → 0.1
Time: 4.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 r21910 = x;
        double r21911 = y;
        double r21912 = z;
        double r21913 = r21911 * r21912;
        double r21914 = r21913 * r21912;
        double r21915 = r21910 + r21914;
        return r21915;
}
↓
double f(double x, double y, double z) {
        double r21916 = x;
        double r21917 = y;
        double r21918 = z;
        double r21919 = r21917 * r21918;
        double r21920 = r21919 * r21918;
        double r21921 = r21916 + r21920;
        return r21921;
}

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