Average Error: 0.1 → 0.1
Time: 20.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 r13482 = x;
        double r13483 = y;
        double r13484 = z;
        double r13485 = r13483 * r13484;
        double r13486 = r13485 * r13484;
        double r13487 = r13482 + r13486;
        return r13487;
}
↓
double f(double x, double y, double z) {
        double r13488 = x;
        double r13489 = y;
        double r13490 = z;
        double r13491 = r13489 * r13490;
        double r13492 = r13491 * r13490;
        double r13493 = r13488 + r13492;
        return r13493;
}

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