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 r791381 = x;
        double r791382 = y;
        double r791383 = r791382 * r791382;
        double r791384 = exp(r791383);
        double r791385 = r791381 * r791384;
        return r791385;
}
↓
double f(double x, double y) {
        double r791386 = x;
        double r791387 = y;
        double r791388 = r791387 * r791387;
        double r791389 = exp(r791388);
        double r791390 = r791386 * r791389;
        return r791390;
}

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 2020020 +o rules:numerics
(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))))