Average Error: 0.0 → 0.0
Time: 3.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 r952251 = x;
        double r952252 = y;
        double r952253 = r952252 * r952252;
        double r952254 = exp(r952253);
        double r952255 = r952251 * r952254;
        return r952255;
}
↓
double f(double x, double y) {
        double r952256 = x;
        double r952257 = y;
        double r952258 = r952257 * r952257;
        double r952259 = exp(r952258);
        double r952260 = r952256 * r952259;
        return r952260;
}

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