Average Error: 0.1 → 0.1
Time: 16.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 r983245 = x;
        double r983246 = y;
        double r983247 = z;
        double r983248 = r983246 * r983247;
        double r983249 = r983248 * r983247;
        double r983250 = r983245 + r983249;
        return r983250;
}
↓
double f(double x, double y, double z) {
        double r983251 = x;
        double r983252 = z;
        double r983253 = y;
        double r983254 = r983252 * r983253;
        double r983255 = r983252 * r983254;
        double r983256 = r983251 + r983255;
        return r983256;
}

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