Average Error: 0.1 → 0.1
Time: 4.9s
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 r24968 = x;
        double r24969 = y;
        double r24970 = z;
        double r24971 = r24969 * r24970;
        double r24972 = r24971 * r24970;
        double r24973 = r24968 + r24972;
        return r24973;
}
↓
double f(double x, double y, double z) {
        double r24974 = x;
        double r24975 = y;
        double r24976 = z;
        double r24977 = r24975 * r24976;
        double r24978 = r24977 * r24976;
        double r24979 = r24974 + r24978;
        return r24979;
}

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