Average Error: 0.1 → 0.1
Time: 7.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 r21746 = x;
        double r21747 = y;
        double r21748 = z;
        double r21749 = r21747 * r21748;
        double r21750 = r21749 * r21748;
        double r21751 = r21746 + r21750;
        return r21751;
}
↓
double f(double x, double y, double z) {
        double r21752 = x;
        double r21753 = y;
        double r21754 = z;
        double r21755 = r21753 * r21754;
        double r21756 = r21755 * r21754;
        double r21757 = r21752 + r21756;
        return r21757;
}

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