Average Error: 0.1 → 0.1
Time: 4.2s
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 r23871 = x;
        double r23872 = y;
        double r23873 = z;
        double r23874 = r23872 * r23873;
        double r23875 = r23874 * r23873;
        double r23876 = r23871 + r23875;
        return r23876;
}
↓
double f(double x, double y, double z) {
        double r23877 = x;
        double r23878 = y;
        double r23879 = z;
        double r23880 = r23878 * r23879;
        double r23881 = r23880 * r23879;
        double r23882 = r23877 + r23881;
        return r23882;
}

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