Average Error: 0.1 → 0.1
Time: 4.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 r21691 = x;
        double r21692 = y;
        double r21693 = z;
        double r21694 = r21692 * r21693;
        double r21695 = r21694 * r21693;
        double r21696 = r21691 + r21695;
        return r21696;
}
↓
double f(double x, double y, double z) {
        double r21697 = x;
        double r21698 = y;
        double r21699 = z;
        double r21700 = r21698 * r21699;
        double r21701 = r21700 * r21699;
        double r21702 = r21697 + r21701;
        return r21702;
}

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