Average Error: 0.1 → 0.1
Time: 2.7s
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 r8837 = x;
        double r8838 = y;
        double r8839 = z;
        double r8840 = r8838 * r8839;
        double r8841 = r8840 * r8839;
        double r8842 = r8837 + r8841;
        return r8842;
}
↓
double f(double x, double y, double z) {
        double r8843 = x;
        double r8844 = y;
        double r8845 = z;
        double r8846 = r8844 * r8845;
        double r8847 = r8846 * r8845;
        double r8848 = r8843 + r8847;
        return r8848;
}

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