Average Error: 0.0 → 0.0
Time: 11.5s
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 r863331 = x;
        double r863332 = y;
        double r863333 = r863332 * r863332;
        double r863334 = exp(r863333);
        double r863335 = r863331 * r863334;
        return r863335;
}
↓
double f(double x, double y) {
        double r863336 = x;
        double r863337 = y;
        double r863338 = r863337 * r863337;
        double r863339 = exp(r863338);
        double r863340 = r863336 * r863339;
        return r863340;
}

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