Average Error: 0.1 → 0.1
Time: 17.8s
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 r919160 = x;
        double r919161 = y;
        double r919162 = z;
        double r919163 = r919161 * r919162;
        double r919164 = r919163 * r919162;
        double r919165 = r919160 + r919164;
        return r919165;
}
↓
double f(double x, double y, double z) {
        double r919166 = x;
        double r919167 = z;
        double r919168 = y;
        double r919169 = r919167 * r919168;
        double r919170 = r919167 * r919169;
        double r919171 = r919166 + r919170;
        return r919171;
}

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