Average Error: 0.1 → 0.1
Time: 18.6s
Precision: 64
\[x + \left(y \cdot z\right) \cdot z\]
↓
\[x + z \cdot \left(z \cdot y\right)\]
x + \left(y \cdot z\right) \cdot z
↓
x + z \cdot \left(z \cdot y\right)
double f(double x, double y, double z) {
        double r733608 = x;
        double r733609 = y;
        double r733610 = z;
        double r733611 = r733609 * r733610;
        double r733612 = r733611 * r733610;
        double r733613 = r733608 + r733612;
        return r733613;
}
↓
double f(double x, double y, double z) {
        double r733614 = x;
        double r733615 = z;
        double r733616 = y;
        double r733617 = r733615 * r733616;
        double r733618 = r733615 * r733617;
        double r733619 = r733614 + r733618;
        return r733619;
}

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 + z \cdot \left(z \cdot y\right)\]

Reproduce

herbie shell --seed 2019163 
(FPCore (x y z)
  :name "Statistics.Sample:robustSumVarWeighted from math-functions-0.1.5.2"
  (+ x (* (* y z) z)))