Average Error: 0.1 → 0.1
Time: 4.4s
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 r22972 = x;
        double r22973 = y;
        double r22974 = z;
        double r22975 = r22973 * r22974;
        double r22976 = r22975 * r22974;
        double r22977 = r22972 + r22976;
        return r22977;
}
↓
double f(double x, double y, double z) {
        double r22978 = x;
        double r22979 = y;
        double r22980 = z;
        double r22981 = r22979 * r22980;
        double r22982 = r22981 * r22980;
        double r22983 = r22978 + r22982;
        return r22983;
}

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