Average Error: 0.1 → 0.1
Time: 16.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 r912973 = x;
        double r912974 = y;
        double r912975 = z;
        double r912976 = r912974 * r912975;
        double r912977 = r912976 * r912975;
        double r912978 = r912973 + r912977;
        return r912978;
}
↓
double f(double x, double y, double z) {
        double r912979 = x;
        double r912980 = z;
        double r912981 = y;
        double r912982 = r912980 * r912981;
        double r912983 = r912980 * r912982;
        double r912984 = r912979 + r912983;
        return r912984;
}

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