Average Error: 0.1 → 0.1
Time: 4.1s
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 r20586 = x;
        double r20587 = y;
        double r20588 = z;
        double r20589 = r20587 * r20588;
        double r20590 = r20589 * r20588;
        double r20591 = r20586 + r20590;
        return r20591;
}
↓
double f(double x, double y, double z) {
        double r20592 = x;
        double r20593 = y;
        double r20594 = z;
        double r20595 = r20593 * r20594;
        double r20596 = r20595 * r20594;
        double r20597 = r20592 + r20596;
        return r20597;
}

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