Average Error: 0.0 → 0.0
Time: 7.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 r610608 = x;
        double r610609 = y;
        double r610610 = r610609 * r610609;
        double r610611 = exp(r610610);
        double r610612 = r610608 * r610611;
        return r610612;
}
↓
double f(double x, double y) {
        double r610613 = x;
        double r610614 = y;
        double r610615 = r610614 * r610614;
        double r610616 = exp(r610615);
        double r610617 = r610613 * r610616;
        return r610617;
}

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