Average Error: 0.0 → 0.0
Time: 1.1s
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 r756085 = x;
        double r756086 = y;
        double r756087 = r756086 * r756086;
        double r756088 = exp(r756087);
        double r756089 = r756085 * r756088;
        return r756089;
}
↓
double f(double x, double y) {
        double r756090 = x;
        double r756091 = y;
        double r756092 = r756091 * r756091;
        double r756093 = exp(r756092);
        double r756094 = r756090 * r756093;
        return r756094;
}

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