Average Error: 0.1 → 0.1
Time: 3.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 r11945 = x;
        double r11946 = y;
        double r11947 = z;
        double r11948 = r11946 * r11947;
        double r11949 = r11948 * r11947;
        double r11950 = r11945 + r11949;
        return r11950;
}
↓
double f(double x, double y, double z) {
        double r11951 = x;
        double r11952 = y;
        double r11953 = z;
        double r11954 = r11952 * r11953;
        double r11955 = r11954 * r11953;
        double r11956 = r11951 + r11955;
        return r11956;
}

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