Average Error: 0.1 → 0.1
Time: 11.3s
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 r10520 = x;
        double r10521 = y;
        double r10522 = z;
        double r10523 = r10521 * r10522;
        double r10524 = r10523 * r10522;
        double r10525 = r10520 + r10524;
        return r10525;
}
↓
double f(double x, double y, double z) {
        double r10526 = x;
        double r10527 = y;
        double r10528 = z;
        double r10529 = r10527 * r10528;
        double r10530 = r10529 * r10528;
        double r10531 = r10526 + r10530;
        return r10531;
}

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