Average Error: 0.1 → 0.1
Time: 4.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 r21629 = x;
        double r21630 = y;
        double r21631 = z;
        double r21632 = r21630 * r21631;
        double r21633 = r21632 * r21631;
        double r21634 = r21629 + r21633;
        return r21634;
}
↓
double f(double x, double y, double z) {
        double r21635 = x;
        double r21636 = y;
        double r21637 = z;
        double r21638 = r21636 * r21637;
        double r21639 = r21638 * r21637;
        double r21640 = r21635 + r21639;
        return r21640;
}

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