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 r733605 = x;
        double r733606 = y;
        double r733607 = z;
        double r733608 = r733606 * r733607;
        double r733609 = r733608 * r733607;
        double r733610 = r733605 + r733609;
        return r733610;
}
↓
double f(double x, double y, double z) {
        double r733611 = x;
        double r733612 = z;
        double r733613 = y;
        double r733614 = r733612 * r733613;
        double r733615 = r733612 * r733614;
        double r733616 = r733611 + r733615;
        return r733616;
}

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)))