Average Error: 0.1 → 0.1
Time: 4.0s
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 r20598 = x;
        double r20599 = y;
        double r20600 = z;
        double r20601 = r20599 * r20600;
        double r20602 = r20601 * r20600;
        double r20603 = r20598 + r20602;
        return r20603;
}
↓
double f(double x, double y, double z) {
        double r20604 = x;
        double r20605 = y;
        double r20606 = z;
        double r20607 = r20605 * r20606;
        double r20608 = r20607 * r20606;
        double r20609 = r20604 + r20608;
        return r20609;
}

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