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 r18532 = x;
        double r18533 = y;
        double r18534 = z;
        double r18535 = r18533 * r18534;
        double r18536 = r18535 * r18534;
        double r18537 = r18532 + r18536;
        return r18537;
}
↓
double f(double x, double y, double z) {
        double r18538 = x;
        double r18539 = y;
        double r18540 = z;
        double r18541 = r18539 * r18540;
        double r18542 = r18541 * r18540;
        double r18543 = r18538 + r18542;
        return r18543;
}

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