Average Error: 0.1 → 0.1
Time: 10.5s
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 r557558 = x;
        double r557559 = y;
        double r557560 = z;
        double r557561 = r557559 * r557560;
        double r557562 = r557561 * r557560;
        double r557563 = r557558 + r557562;
        return r557563;
}
↓
double f(double x, double y, double z) {
        double r557564 = x;
        double r557565 = z;
        double r557566 = y;
        double r557567 = r557565 * r557566;
        double r557568 = r557565 * r557567;
        double r557569 = r557564 + r557568;
        return r557569;
}

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