Average Error: 0.1 → 0.1
Time: 3.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 r14045 = x;
        double r14046 = y;
        double r14047 = z;
        double r14048 = r14046 * r14047;
        double r14049 = r14048 * r14047;
        double r14050 = r14045 + r14049;
        return r14050;
}
↓
double f(double x, double y, double z) {
        double r14051 = x;
        double r14052 = y;
        double r14053 = z;
        double r14054 = r14052 * r14053;
        double r14055 = r14054 * r14053;
        double r14056 = r14051 + r14055;
        return r14056;
}

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