Average Error: 0.1 → 0.1
Time: 4.2s
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 r22449 = x;
        double r22450 = y;
        double r22451 = z;
        double r22452 = r22450 * r22451;
        double r22453 = r22452 * r22451;
        double r22454 = r22449 + r22453;
        return r22454;
}
↓
double f(double x, double y, double z) {
        double r22455 = x;
        double r22456 = y;
        double r22457 = z;
        double r22458 = r22456 * r22457;
        double r22459 = r22458 * r22457;
        double r22460 = r22455 + r22459;
        return r22460;
}

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