Average Error: 0.1 → 0.1
Time: 3.5s
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 r15440 = x;
        double r15441 = y;
        double r15442 = z;
        double r15443 = r15441 * r15442;
        double r15444 = r15443 * r15442;
        double r15445 = r15440 + r15444;
        return r15445;
}
↓
double f(double x, double y, double z) {
        double r15446 = x;
        double r15447 = y;
        double r15448 = z;
        double r15449 = r15447 * r15448;
        double r15450 = r15449 * r15448;
        double r15451 = r15446 + r15450;
        return r15451;
}

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