Average Error: 0.0 → 0.0
Time: 2.0s
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 r737877 = x;
        double r737878 = y;
        double r737879 = r737878 * r737878;
        double r737880 = exp(r737879);
        double r737881 = r737877 * r737880;
        return r737881;
}
↓
double f(double x, double y) {
        double r737882 = x;
        double r737883 = y;
        double r737884 = r737883 * r737883;
        double r737885 = exp(r737884);
        double r737886 = r737882 * r737885;
        return r737886;
}

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