Average Error: 0.0 → 0.0
Time: 5.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 r596754 = x;
        double r596755 = y;
        double r596756 = r596755 * r596755;
        double r596757 = exp(r596756);
        double r596758 = r596754 * r596757;
        return r596758;
}
↓
double f(double x, double y) {
        double r596759 = x;
        double r596760 = y;
        double r596761 = r596760 * r596760;
        double r596762 = exp(r596761);
        double r596763 = r596759 * r596762;
        return r596763;
}

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