Average Error: 0.1 → 0.1
Time: 2.8s
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 r11660 = x;
        double r11661 = y;
        double r11662 = z;
        double r11663 = r11661 * r11662;
        double r11664 = r11663 * r11662;
        double r11665 = r11660 + r11664;
        return r11665;
}
↓
double f(double x, double y, double z) {
        double r11666 = x;
        double r11667 = y;
        double r11668 = z;
        double r11669 = r11667 * r11668;
        double r11670 = r11669 * r11668;
        double r11671 = r11666 + r11670;
        return r11671;
}

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