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 r21252 = x;
        double r21253 = y;
        double r21254 = z;
        double r21255 = r21253 * r21254;
        double r21256 = r21255 * r21254;
        double r21257 = r21252 + r21256;
        return r21257;
}
↓
double f(double x, double y, double z) {
        double r21258 = x;
        double r21259 = y;
        double r21260 = z;
        double r21261 = r21259 * r21260;
        double r21262 = r21261 * r21260;
        double r21263 = r21258 + r21262;
        return r21263;
}

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