Average Error: 0.1 → 0.1
Time: 3.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 r14440 = x;
        double r14441 = y;
        double r14442 = z;
        double r14443 = r14441 * r14442;
        double r14444 = r14443 * r14442;
        double r14445 = r14440 + r14444;
        return r14445;
}
↓
double f(double x, double y, double z) {
        double r14446 = x;
        double r14447 = y;
        double r14448 = z;
        double r14449 = r14447 * r14448;
        double r14450 = r14449 * r14448;
        double r14451 = r14446 + r14450;
        return r14451;
}

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