Average Error: 0.1 → 0.1
Time: 11.0s
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 r827309 = x;
        double r827310 = y;
        double r827311 = z;
        double r827312 = r827310 * r827311;
        double r827313 = r827312 * r827311;
        double r827314 = r827309 + r827313;
        return r827314;
}
↓
double f(double x, double y, double z) {
        double r827315 = x;
        double r827316 = z;
        double r827317 = y;
        double r827318 = r827316 * r827317;
        double r827319 = r827316 * r827318;
        double r827320 = r827315 + r827319;
        return r827320;
}

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