Average Error: 0.1 → 0.1
Time: 17.3s
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 r22854 = x;
        double r22855 = y;
        double r22856 = z;
        double r22857 = r22855 * r22856;
        double r22858 = r22857 * r22856;
        double r22859 = r22854 + r22858;
        return r22859;
}
↓
double f(double x, double y, double z) {
        double r22860 = x;
        double r22861 = y;
        double r22862 = z;
        double r22863 = r22861 * r22862;
        double r22864 = r22863 * r22862;
        double r22865 = r22860 + r22864;
        return r22865;
}

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