Average Error: 0.1 → 0.1
Time: 37.1s
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 r886485 = x;
        double r886486 = y;
        double r886487 = z;
        double r886488 = r886486 * r886487;
        double r886489 = r886488 * r886487;
        double r886490 = r886485 + r886489;
        return r886490;
}
↓
double f(double x, double y, double z) {
        double r886491 = x;
        double r886492 = z;
        double r886493 = y;
        double r886494 = r886492 * r886493;
        double r886495 = r886492 * r886494;
        double r886496 = r886491 + r886495;
        return r886496;
}

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