Average Error: 0.1 → 0.1
Time: 15.8s
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 r6599 = x;
        double r6600 = y;
        double r6601 = z;
        double r6602 = r6600 * r6601;
        double r6603 = r6602 * r6601;
        double r6604 = r6599 + r6603;
        return r6604;
}
↓
double f(double x, double y, double z) {
        double r6605 = x;
        double r6606 = y;
        double r6607 = z;
        double r6608 = r6606 * r6607;
        double r6609 = r6608 * r6607;
        double r6610 = r6605 + r6609;
        return r6610;
}

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