Average Error: 0.0 → 0.0
Time: 4.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 r4638 = x;
        double r4639 = y;
        double r4640 = r4639 * r4639;
        double r4641 = exp(r4640);
        double r4642 = r4638 * r4641;
        return r4642;
}
↓
double f(double x, double y) {
        double r4643 = x;
        double r4644 = y;
        double r4645 = r4644 * r4644;
        double r4646 = exp(r4645);
        double r4647 = r4643 * r4646;
        return r4647;
}

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