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 r21700 = x;
        double r21701 = y;
        double r21702 = z;
        double r21703 = r21701 * r21702;
        double r21704 = r21703 * r21702;
        double r21705 = r21700 + r21704;
        return r21705;
}
↓
double f(double x, double y, double z) {
        double r21706 = x;
        double r21707 = y;
        double r21708 = z;
        double r21709 = r21707 * r21708;
        double r21710 = r21709 * r21708;
        double r21711 = r21706 + r21710;
        return r21711;
}

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