Average Error: 0.1 → 0.1
Time: 12.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 r25077 = x;
        double r25078 = y;
        double r25079 = z;
        double r25080 = r25078 * r25079;
        double r25081 = r25080 * r25079;
        double r25082 = r25077 + r25081;
        return r25082;
}
↓
double f(double x, double y, double z) {
        double r25083 = x;
        double r25084 = y;
        double r25085 = z;
        double r25086 = r25084 * r25085;
        double r25087 = r25086 * r25085;
        double r25088 = r25083 + r25087;
        return r25088;
}

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