Average Error: 0.1 → 0.1
Time: 14.6s
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 r843544 = x;
        double r843545 = y;
        double r843546 = z;
        double r843547 = r843545 * r843546;
        double r843548 = r843547 * r843546;
        double r843549 = r843544 + r843548;
        return r843549;
}
↓
double f(double x, double y, double z) {
        double r843550 = x;
        double r843551 = z;
        double r843552 = y;
        double r843553 = r843551 * r843552;
        double r843554 = r843551 * r843553;
        double r843555 = r843550 + r843554;
        return r843555;
}

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