Average Error: 0.1 → 0.1
Time: 3.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 r13693 = x;
        double r13694 = y;
        double r13695 = z;
        double r13696 = r13694 * r13695;
        double r13697 = r13696 * r13695;
        double r13698 = r13693 + r13697;
        return r13698;
}
↓
double f(double x, double y, double z) {
        double r13699 = x;
        double r13700 = y;
        double r13701 = z;
        double r13702 = r13700 * r13701;
        double r13703 = r13702 * r13701;
        double r13704 = r13699 + r13703;
        return r13704;
}

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