Average Error: 0.1 → 0.1
Time: 11.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 r11162 = x;
        double r11163 = y;
        double r11164 = z;
        double r11165 = r11163 * r11164;
        double r11166 = r11165 * r11164;
        double r11167 = r11162 + r11166;
        return r11167;
}
↓
double f(double x, double y, double z) {
        double r11168 = x;
        double r11169 = y;
        double r11170 = z;
        double r11171 = r11169 * r11170;
        double r11172 = r11171 * r11170;
        double r11173 = r11168 + r11172;
        return r11173;
}

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