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 r757777 = x;
        double r757778 = y;
        double r757779 = r757778 * r757778;
        double r757780 = exp(r757779);
        double r757781 = r757777 * r757780;
        return r757781;
}
↓
double f(double x, double y) {
        double r757782 = x;
        double r757783 = y;
        double r757784 = r757783 * r757783;
        double r757785 = exp(r757784);
        double r757786 = r757782 * r757785;
        return r757786;
}

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