Average Error: 0.1 → 0.1
Time: 20.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 r19633 = x;
        double r19634 = y;
        double r19635 = z;
        double r19636 = r19634 * r19635;
        double r19637 = r19636 * r19635;
        double r19638 = r19633 + r19637;
        return r19638;
}
↓
double f(double x, double y, double z) {
        double r19639 = x;
        double r19640 = y;
        double r19641 = z;
        double r19642 = r19640 * r19641;
        double r19643 = r19642 * r19641;
        double r19644 = r19639 + r19643;
        return r19644;
}

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