Average Error: 0.0 → 0.0
Time: 4.4s
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 r207880 = x;
        double r207881 = y;
        double r207882 = r207880 * r207881;
        double r207883 = r207882 * r207881;
        double r207884 = exp(r207883);
        return r207884;
}
↓
double f(double x, double y) {
        double r207885 = x;
        double r207886 = y;
        double r207887 = r207885 * r207886;
        double r207888 = r207887 * r207886;
        double r207889 = exp(r207888);
        return r207889;
}

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)))