Average Error: 0.0 → 0.0
Time: 1.9s
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 r876564 = x;
        double r876565 = y;
        double r876566 = r876565 * r876565;
        double r876567 = exp(r876566);
        double r876568 = r876564 * r876567;
        return r876568;
}
↓
double f(double x, double y) {
        double r876569 = x;
        double r876570 = y;
        double r876571 = r876570 * r876570;
        double r876572 = exp(r876571);
        double r876573 = r876569 * r876572;
        return r876573;
}

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