Average Error: 0.0 → 0.0
Time: 4.2s
Precision: 64
\[e^{\left(x \cdot y\right) \cdot y}\]
↓
\[e^{\left(x \cdot y\right) \cdot y}\]
e^{\left(x \cdot y\right) \cdot y}
↓
e^{\left(x \cdot y\right) \cdot y}
double f(double x, double y) {
        double r157931 = x;
        double r157932 = y;
        double r157933 = r157931 * r157932;
        double r157934 = r157933 * r157932;
        double r157935 = exp(r157934);
        return r157935;
}
↓
double f(double x, double y) {
        double r157936 = x;
        double r157937 = y;
        double r157938 = r157936 * r157937;
        double r157939 = r157938 * r157937;
        double r157940 = exp(r157939);
        return r157940;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[e^{\left(x \cdot y\right) \cdot y}\]

  2. Final simplification0.0

    \[\leadsto e^{\left(x \cdot y\right) \cdot y}\]

Reproduce

herbie shell --seed 2020045 +o rules:numerics
(FPCore (x y)
  :name "Data.Random.Distribution.Normal:normalF from random-fu-0.2.6.2"
  :precision binary64
  (exp (* (* x y) y)))