Average Error: 0.0 → 0.0
Time: 1.8s
Precision: binary64
\[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}
(FPCore (x y) :precision binary64 (* x (exp (* y y))))
↓
(FPCore (x y) :precision binary64 (* x (pow (exp y) y)))
double code(double x, double y) {
	return ((double) (x * ((double) exp(((double) (y * y))))));
}
↓
double code(double x, double y) {
	return ((double) (x * ((double) pow(((double) exp(y)), y))));
}

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 Error: 0.0 bits

    \[x \cdot e^{y \cdot y}\]

  2. SimplifiedError: 0.0 bits

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

  3. Final simplificationError: 0.0 bits

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

Reproduce

herbie shell --seed 2020203 
(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))))