Average Error: 0.0 → 0.0
Time: 6.9s
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 r164681 = x;
        double r164682 = y;
        double r164683 = r164681 * r164682;
        double r164684 = r164683 * r164682;
        double r164685 = exp(r164684);
        return r164685;
}
↓
double f(double x, double y) {
        double r164686 = x;
        double r164687 = y;
        double r164688 = r164686 * r164687;
        double r164689 = r164688 * r164687;
        double r164690 = exp(r164689);
        return r164690;
}

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