Average Error: 0.1 → 0.1
Time: 1.1m
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 r24625 = x;
        double r24626 = y;
        double r24627 = z;
        double r24628 = r24626 * r24627;
        double r24629 = r24628 * r24627;
        double r24630 = r24625 + r24629;
        return r24630;
}
↓
double f(double x, double y, double z) {
        double r24631 = x;
        double r24632 = y;
        double r24633 = z;
        double r24634 = r24632 * r24633;
        double r24635 = r24634 * r24633;
        double r24636 = r24631 + r24635;
        return r24636;
}

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