Average Error: 0.0 → 0.0
Time: 21.8s
Precision: 64
\[x \cdot e^{y \cdot y}\]
↓
\[x \cdot {\left(e^{y}\right)}^{y}\]
x \cdot e^{y \cdot y}
↓
x \cdot {\left(e^{y}\right)}^{y}
double f(double x, double y) {
        double r97657938 = x;
        double r97657939 = y;
        double r97657940 = r97657939 * r97657939;
        double r97657941 = exp(r97657940);
        double r97657942 = r97657938 * r97657941;
        return r97657942;
}
↓
double f(double x, double y) {
        double r97657943 = x;
        double r97657944 = y;
        double r97657945 = exp(r97657944);
        double r97657946 = pow(r97657945, r97657944);
        double r97657947 = r97657943 * r97657946;
        return r97657947;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.0
Target0.0
Herbie0.0
\[x \cdot {\left(e^{y}\right)}^{y}\]

Derivation

  1. Initial program 0.0

    \[x \cdot e^{y \cdot y}\]
  2. Using strategy rm

  3. Applied add-log-exp0.0

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

  4. Applied exp-to-pow0.0

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

  5. Final simplification0.0

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

Reproduce

herbie shell --seed 2019173 +o rules:numerics
(FPCore (x y)
  :name "Data.Number.Erf:$dmerfcx from erf-2.0.0.0"

  :herbie-target
  (* x (pow (exp y) y))

  (* x (exp (* y y))))