Average Error: 0.1 → 0.1
Time: 4.6s
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 r26672 = x;
        double r26673 = y;
        double r26674 = z;
        double r26675 = r26673 * r26674;
        double r26676 = r26675 * r26674;
        double r26677 = r26672 + r26676;
        return r26677;
}
↓
double f(double x, double y, double z) {
        double r26678 = x;
        double r26679 = y;
        double r26680 = z;
        double r26681 = r26679 * r26680;
        double r26682 = r26681 * r26680;
        double r26683 = r26678 + r26682;
        return r26683;
}

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