Average Error: 0.0 → 0.0
Time: 8.8s
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 r477603 = x;
        double r477604 = y;
        double r477605 = r477604 * r477604;
        double r477606 = exp(r477605);
        double r477607 = r477603 * r477606;
        return r477607;
}
↓
double f(double x, double y) {
        double r477608 = x;
        double r477609 = y;
        double r477610 = r477609 * r477609;
        double r477611 = exp(r477610);
        double r477612 = r477608 * r477611;
        return r477612;
}

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