Average Error: 0.0 → 0.0
Time: 11.2s
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 r1053302 = x;
        double r1053303 = y;
        double r1053304 = r1053303 * r1053303;
        double r1053305 = exp(r1053304);
        double r1053306 = r1053302 * r1053305;
        return r1053306;
}
↓
double f(double x, double y) {
        double r1053307 = x;
        double r1053308 = y;
        double r1053309 = r1053308 * r1053308;
        double r1053310 = exp(r1053309);
        double r1053311 = r1053307 * r1053310;
        return r1053311;
}

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