Average Error: 0.1 → 0.1
Time: 17.2s
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 r983304 = x;
        double r983305 = y;
        double r983306 = z;
        double r983307 = r983305 * r983306;
        double r983308 = r983307 * r983306;
        double r983309 = r983304 + r983308;
        return r983309;
}
↓
double f(double x, double y, double z) {
        double r983310 = x;
        double r983311 = z;
        double r983312 = y;
        double r983313 = r983311 * r983312;
        double r983314 = r983311 * r983313;
        double r983315 = r983310 + r983314;
        return r983315;
}

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)))