Average Error: 0.1 → 0.1
Time: 3.3s
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 r14565 = x;
        double r14566 = y;
        double r14567 = z;
        double r14568 = r14566 * r14567;
        double r14569 = r14568 * r14567;
        double r14570 = r14565 + r14569;
        return r14570;
}
↓
double f(double x, double y, double z) {
        double r14571 = x;
        double r14572 = y;
        double r14573 = z;
        double r14574 = r14572 * r14573;
        double r14575 = r14574 * r14573;
        double r14576 = r14571 + r14575;
        return r14576;
}

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