Average Error: 0.1 → 0.1
Time: 8.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 r22652 = x;
        double r22653 = y;
        double r22654 = z;
        double r22655 = r22653 * r22654;
        double r22656 = r22655 * r22654;
        double r22657 = r22652 + r22656;
        return r22657;
}
↓
double f(double x, double y, double z) {
        double r22658 = x;
        double r22659 = y;
        double r22660 = z;
        double r22661 = r22659 * r22660;
        double r22662 = r22661 * r22660;
        double r22663 = r22658 + r22662;
        return r22663;
}

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