Average Error: 0.0 → 0.0
Time: 1.5s
Precision: 64
\[x \cdot e^{y \cdot y}\]
↓
\[x \cdot e^{y \cdot y}\]
x \cdot e^{y \cdot y}
↓
x \cdot e^{y \cdot y}
double f(double x, double y) {
        double r773741 = x;
        double r773742 = y;
        double r773743 = r773742 * r773742;
        double r773744 = exp(r773743);
        double r773745 = r773741 * r773744;
        return r773745;
}
↓
double f(double x, double y) {
        double r773746 = x;
        double r773747 = y;
        double r773748 = r773747 * r773747;
        double r773749 = exp(r773748);
        double r773750 = r773746 * r773749;
        return r773750;
}

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. Final simplification0.0

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

Reproduce

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