Average Error: 0.0 → 0.0
Time: 13.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 r912768 = x;
        double r912769 = y;
        double r912770 = r912769 * r912769;
        double r912771 = exp(r912770);
        double r912772 = r912768 * r912771;
        return r912772;
}
↓
double f(double x, double y) {
        double r912773 = x;
        double r912774 = y;
        double r912775 = r912774 * r912774;
        double r912776 = exp(r912775);
        double r912777 = r912773 * r912776;
        return r912777;
}

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 2020047 +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))))