Average Error: 0.1 → 0.1
Time: 15.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 r31324 = x;
        double r31325 = y;
        double r31326 = z;
        double r31327 = r31325 * r31326;
        double r31328 = r31327 * r31326;
        double r31329 = r31324 + r31328;
        return r31329;
}
↓
double f(double x, double y, double z) {
        double r31330 = x;
        double r31331 = y;
        double r31332 = z;
        double r31333 = r31331 * r31332;
        double r31334 = r31333 * r31332;
        double r31335 = r31330 + r31334;
        return r31335;
}

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