Average Error: 0.1 → 0.1
Time: 21.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 r30111 = x;
        double r30112 = y;
        double r30113 = z;
        double r30114 = r30112 * r30113;
        double r30115 = r30114 * r30113;
        double r30116 = r30111 + r30115;
        return r30116;
}
↓
double f(double x, double y, double z) {
        double r30117 = x;
        double r30118 = y;
        double r30119 = z;
        double r30120 = r30118 * r30119;
        double r30121 = r30120 * r30119;
        double r30122 = r30117 + r30121;
        return r30122;
}

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