Average Error: 0.1 → 0.1
Time: 15.1s
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 r503706 = x;
        double r503707 = y;
        double r503708 = z;
        double r503709 = r503707 * r503708;
        double r503710 = r503709 * r503708;
        double r503711 = r503706 + r503710;
        return r503711;
}
↓
double f(double x, double y, double z) {
        double r503712 = x;
        double r503713 = z;
        double r503714 = y;
        double r503715 = r503713 * r503714;
        double r503716 = r503713 * r503715;
        double r503717 = r503712 + r503716;
        return r503717;
}

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