Average Error: 0.1 → 0.1
Time: 3.5s
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 r17709 = x;
        double r17710 = y;
        double r17711 = z;
        double r17712 = r17710 * r17711;
        double r17713 = r17712 * r17711;
        double r17714 = r17709 + r17713;
        return r17714;
}
↓
double f(double x, double y, double z) {
        double r17715 = x;
        double r17716 = y;
        double r17717 = z;
        double r17718 = r17716 * r17717;
        double r17719 = r17718 * r17717;
        double r17720 = r17715 + r17719;
        return r17720;
}

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