Average Error: 0.0 → 0.0
Time: 12.7s
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 r1038753 = x;
        double r1038754 = y;
        double r1038755 = r1038754 * r1038754;
        double r1038756 = exp(r1038755);
        double r1038757 = r1038753 * r1038756;
        return r1038757;
}
↓
double f(double x, double y) {
        double r1038758 = x;
        double r1038759 = y;
        double r1038760 = r1038759 * r1038759;
        double r1038761 = exp(r1038760);
        double r1038762 = r1038758 * r1038761;
        return r1038762;
}

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