Average Error: 0.0 → 0.0
Time: 1.1s
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 r791184 = x;
        double r791185 = y;
        double r791186 = r791185 * r791185;
        double r791187 = exp(r791186);
        double r791188 = r791184 * r791187;
        return r791188;
}

double f(double x, double y) {
        double r791189 = x;
        double r791190 = y;
        double r791191 = exp(r791190);
        double r791192 = pow(r791191, r791190);
        double r791193 = r791189 * r791192;
        return r791193;
}

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 2020049 
(FPCore (x y)
  :name "Data.Number.Erf:$dmerfcx from erf-2.0.0.0"
  :precision binary64

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

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