Average Error: 0.1 → 0.1
Time: 11.7s
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 r922174 = x;
        double r922175 = y;
        double r922176 = z;
        double r922177 = r922175 * r922176;
        double r922178 = r922177 * r922176;
        double r922179 = r922174 + r922178;
        return r922179;
}
↓
double f(double x, double y, double z) {
        double r922180 = x;
        double r922181 = y;
        double r922182 = z;
        double r922183 = r922181 * r922182;
        double r922184 = r922183 * r922182;
        double r922185 = r922180 + r922184;
        return r922185;
}

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