Average Error: 0.0 → 0.0
Time: 7.5s
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 r548942 = x;
        double r548943 = y;
        double r548944 = r548943 * r548943;
        double r548945 = exp(r548944);
        double r548946 = r548942 * r548945;
        return r548946;
}
↓
double f(double x, double y) {
        double r548947 = x;
        double r548948 = y;
        double r548949 = r548948 * r548948;
        double r548950 = exp(r548949);
        double r548951 = r548947 * r548950;
        return r548951;
}

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 
(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))))