Average Error: 0.0 → 0.0
Time: 15.1s
Precision: 64
\[x \cdot e^{y \cdot y}\]
↓
\[{\left(e^{y}\right)}^{y} \cdot x\]
x \cdot e^{y \cdot y}
↓
{\left(e^{y}\right)}^{y} \cdot x
double f(double x, double y) {
        double r28712928 = x;
        double r28712929 = y;
        double r28712930 = r28712929 * r28712929;
        double r28712931 = exp(r28712930);
        double r28712932 = r28712928 * r28712931;
        return r28712932;
}
↓
double f(double x, double y) {
        double r28712933 = y;
        double r28712934 = exp(r28712933);
        double r28712935 = pow(r28712934, r28712933);
        double r28712936 = x;
        double r28712937 = r28712935 * r28712936;
        return r28712937;
}

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 {\left(e^{y}\right)}^{y} \cdot x\]

Reproduce

herbie shell --seed 2019163 +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))))