Average Error: 0.1 → 0.1
Time: 38.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 r883131 = x;
        double r883132 = y;
        double r883133 = z;
        double r883134 = r883132 * r883133;
        double r883135 = r883134 * r883133;
        double r883136 = r883131 + r883135;
        return r883136;
}
↓
double f(double x, double y, double z) {
        double r883137 = x;
        double r883138 = z;
        double r883139 = y;
        double r883140 = r883138 * r883139;
        double r883141 = r883138 * r883140;
        double r883142 = r883137 + r883141;
        return r883142;
}

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