Average Error: 0.0 → 0.0
Time: 1.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 r732475 = x;
        double r732476 = y;
        double r732477 = r732476 * r732476;
        double r732478 = exp(r732477);
        double r732479 = r732475 * r732478;
        return r732479;
}
↓
double f(double x, double y) {
        double r732480 = x;
        double r732481 = y;
        double r732482 = r732481 * r732481;
        double r732483 = exp(r732482);
        double r732484 = r732480 * r732483;
        return r732484;
}

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