Average Error: 0.0 → 0.0
Time: 10.2s
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 r484060 = x;
        double r484061 = y;
        double r484062 = r484061 * r484061;
        double r484063 = exp(r484062);
        double r484064 = r484060 * r484063;
        return r484064;
}
↓
double f(double x, double y) {
        double r484065 = x;
        double r484066 = y;
        double r484067 = r484066 * r484066;
        double r484068 = exp(r484067);
        double r484069 = r484065 * r484068;
        return r484069;
}

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