Average Error: 0.0 → 0.0
Time: 15.0s
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 r520119 = x;
        double r520120 = y;
        double r520121 = r520120 * r520120;
        double r520122 = exp(r520121);
        double r520123 = r520119 * r520122;
        return r520123;
}
↓
double f(double x, double y) {
        double r520124 = x;
        double r520125 = y;
        double r520126 = r520125 * r520125;
        double r520127 = exp(r520126);
        double r520128 = r520124 * r520127;
        return r520128;
}

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 2019304 
(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))))