Average Error: 0.1 → 0.1
Time: 2.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 r6456 = x;
        double r6457 = y;
        double r6458 = z;
        double r6459 = r6457 * r6458;
        double r6460 = r6459 * r6458;
        double r6461 = r6456 + r6460;
        return r6461;
}
↓
double f(double x, double y, double z) {
        double r6462 = x;
        double r6463 = y;
        double r6464 = z;
        double r6465 = r6463 * r6464;
        double r6466 = r6465 * r6464;
        double r6467 = r6462 + r6466;
        return r6467;
}

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