Average Error: 0.0 → 0.0
Time: 8.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 r510216 = x;
        double r510217 = y;
        double r510218 = r510217 * r510217;
        double r510219 = exp(r510218);
        double r510220 = r510216 * r510219;
        return r510220;
}
↓
double f(double x, double y) {
        double r510221 = x;
        double r510222 = y;
        double r510223 = r510222 * r510222;
        double r510224 = exp(r510223);
        double r510225 = r510221 * r510224;
        return r510225;
}

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