Average Error: 0.1 → 0.1
Time: 3.3s
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 r12964 = x;
        double r12965 = y;
        double r12966 = z;
        double r12967 = r12965 * r12966;
        double r12968 = r12967 * r12966;
        double r12969 = r12964 + r12968;
        return r12969;
}
↓
double f(double x, double y, double z) {
        double r12970 = x;
        double r12971 = y;
        double r12972 = z;
        double r12973 = r12971 * r12972;
        double r12974 = r12973 * r12972;
        double r12975 = r12970 + r12974;
        return r12975;
}

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