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 r21059 = x;
        double r21060 = y;
        double r21061 = z;
        double r21062 = r21060 * r21061;
        double r21063 = r21062 * r21061;
        double r21064 = r21059 + r21063;
        return r21064;
}
↓
double f(double x, double y, double z) {
        double r21065 = x;
        double r21066 = y;
        double r21067 = z;
        double r21068 = r21066 * r21067;
        double r21069 = r21068 * r21067;
        double r21070 = r21065 + r21069;
        return r21070;
}

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)))