Average Error: 0.1 → 0.1
Time: 59.6s
Precision: 64
\[x + \left(y \cdot z\right) \cdot z\]
↓
\[z \cdot \left(z \cdot y\right) + x\]
x + \left(y \cdot z\right) \cdot z
↓
z \cdot \left(z \cdot y\right) + x
double f(double x, double y, double z) {
        double r839286 = x;
        double r839287 = y;
        double r839288 = z;
        double r839289 = r839287 * r839288;
        double r839290 = r839289 * r839288;
        double r839291 = r839286 + r839290;
        return r839291;
}
↓
double f(double x, double y, double z) {
        double r839292 = z;
        double r839293 = y;
        double r839294 = r839292 * r839293;
        double r839295 = r839292 * r839294;
        double r839296 = x;
        double r839297 = r839295 + r839296;
        return r839297;
}

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 z \cdot \left(z \cdot y\right) + x\]

Reproduce

herbie shell --seed 2019200 
(FPCore (x y z)
  :name "Statistics.Sample:robustSumVarWeighted from math-functions-0.1.5.2"
  (+ x (* (* y z) z)))