Average Error: 0.0 → 0.0
Time: 14.9s
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 r905276 = x;
        double r905277 = y;
        double r905278 = r905277 * r905277;
        double r905279 = exp(r905278);
        double r905280 = r905276 * r905279;
        return r905280;
}
↓
double f(double x, double y) {
        double r905281 = x;
        double r905282 = y;
        double r905283 = r905282 * r905282;
        double r905284 = exp(r905283);
        double r905285 = r905281 * r905284;
        return r905285;
}

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