Average Error: 0.0 → 0.0
Time: 1.4s
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 r809606 = x;
        double r809607 = y;
        double r809608 = r809607 * r809607;
        double r809609 = exp(r809608);
        double r809610 = r809606 * r809609;
        return r809610;
}
↓
double f(double x, double y) {
        double r809611 = x;
        double r809612 = y;
        double r809613 = r809612 * r809612;
        double r809614 = exp(r809613);
        double r809615 = r809611 * r809614;
        return r809615;
}

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