Average Error: 0.1 → 0.1
Time: 11.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 r11057 = x;
        double r11058 = y;
        double r11059 = z;
        double r11060 = r11058 * r11059;
        double r11061 = r11060 * r11059;
        double r11062 = r11057 + r11061;
        return r11062;
}
↓
double f(double x, double y, double z) {
        double r11063 = x;
        double r11064 = y;
        double r11065 = z;
        double r11066 = r11064 * r11065;
        double r11067 = r11066 * r11065;
        double r11068 = r11063 + r11067;
        return r11068;
}

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)))