Average Error: 0.0 → 0.0
Time: 1.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 r765591 = x;
        double r765592 = y;
        double r765593 = r765592 * r765592;
        double r765594 = exp(r765593);
        double r765595 = r765591 * r765594;
        return r765595;
}
↓
double f(double x, double y) {
        double r765596 = x;
        double r765597 = y;
        double r765598 = r765597 * r765597;
        double r765599 = exp(r765598);
        double r765600 = r765596 * r765599;
        return r765600;
}

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