Average Error: 0.1 → 0.1
Time: 19.6s
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 r21267 = x;
        double r21268 = y;
        double r21269 = z;
        double r21270 = r21268 * r21269;
        double r21271 = r21270 * r21269;
        double r21272 = r21267 + r21271;
        return r21272;
}
↓
double f(double x, double y, double z) {
        double r21273 = x;
        double r21274 = y;
        double r21275 = z;
        double r21276 = r21274 * r21275;
        double r21277 = r21276 * r21275;
        double r21278 = r21273 + r21277;
        return r21278;
}

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