Average Error: 0.0 → 0.0
Time: 26.6s
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 r483747 = x;
        double r483748 = y;
        double r483749 = r483748 * r483748;
        double r483750 = exp(r483749);
        double r483751 = r483747 * r483750;
        return r483751;
}
↓
double f(double x, double y) {
        double r483752 = x;
        double r483753 = y;
        double r483754 = r483753 * r483753;
        double r483755 = exp(r483754);
        double r483756 = r483752 * r483755;
        return r483756;
}

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