Average Error: 0.1 → 0.1
Time: 6.9s
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 r24822 = x;
        double r24823 = y;
        double r24824 = z;
        double r24825 = r24823 * r24824;
        double r24826 = r24825 * r24824;
        double r24827 = r24822 + r24826;
        return r24827;
}
↓
double f(double x, double y, double z) {
        double r24828 = x;
        double r24829 = y;
        double r24830 = z;
        double r24831 = r24829 * r24830;
        double r24832 = r24831 * r24830;
        double r24833 = r24828 + r24832;
        return r24833;
}

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