Average Error: 0.1 → 0.1
Time: 11.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 r24127 = x;
        double r24128 = y;
        double r24129 = z;
        double r24130 = r24128 * r24129;
        double r24131 = r24130 * r24129;
        double r24132 = r24127 + r24131;
        return r24132;
}
↓
double f(double x, double y, double z) {
        double r24133 = x;
        double r24134 = y;
        double r24135 = z;
        double r24136 = r24134 * r24135;
        double r24137 = r24136 * r24135;
        double r24138 = r24133 + r24137;
        return r24138;
}

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