Average Error: 0.1 → 0.1
Time: 21.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 r30131 = x;
        double r30132 = y;
        double r30133 = z;
        double r30134 = r30132 * r30133;
        double r30135 = r30134 * r30133;
        double r30136 = r30131 + r30135;
        return r30136;
}
↓
double f(double x, double y, double z) {
        double r30137 = x;
        double r30138 = y;
        double r30139 = z;
        double r30140 = r30138 * r30139;
        double r30141 = r30140 * r30139;
        double r30142 = r30137 + r30141;
        return r30142;
}

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