Average Error: 0.1 → 0.1
Time: 8.5s
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 r12661 = x;
        double r12662 = y;
        double r12663 = z;
        double r12664 = r12662 * r12663;
        double r12665 = r12664 * r12663;
        double r12666 = r12661 + r12665;
        return r12666;
}
↓
double f(double x, double y, double z) {
        double r12667 = x;
        double r12668 = y;
        double r12669 = z;
        double r12670 = r12668 * r12669;
        double r12671 = r12670 * r12669;
        double r12672 = r12667 + r12671;
        return r12672;
}

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