Average Error: 0.1 → 0.1
Time: 3.3s
Precision: 64
\[x + \left(y \cdot z\right) \cdot z\]
↓
\[x + \left(y \cdot z\right) \cdot z\]
x + \left(y \cdot z\right) \cdot z
↓
x + \left(y \cdot z\right) \cdot z
double f(double x, double y, double z) {
        double r13973 = x;
        double r13974 = y;
        double r13975 = z;
        double r13976 = r13974 * r13975;
        double r13977 = r13976 * r13975;
        double r13978 = r13973 + r13977;
        return r13978;
}
↓
double f(double x, double y, double z) {
        double r13979 = x;
        double r13980 = y;
        double r13981 = z;
        double r13982 = r13980 * r13981;
        double r13983 = r13982 * r13981;
        double r13984 = r13979 + r13983;
        return r13984;
}

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 + \left(y \cdot z\right) \cdot z\]

Reproduce

herbie shell --seed 2019362 
(FPCore (x y z)
  :name "Statistics.Sample:robustSumVarWeighted from math-functions-0.1.5.2"
  :precision binary64
  (+ x (* (* y z) z)))