Average Error: 0.1 → 0.1
Time: 9.7s
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 r241179 = x;
        double r241180 = y;
        double r241181 = z;
        double r241182 = r241180 * r241181;
        double r241183 = r241182 * r241181;
        double r241184 = r241179 + r241183;
        return r241184;
}
↓
double f(double x, double y, double z) {
        double r241185 = x;
        double r241186 = z;
        double r241187 = y;
        double r241188 = r241186 * r241187;
        double r241189 = r241186 * r241188;
        double r241190 = r241185 + r241189;
        return r241190;
}

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