Average Error: 0.0 → 0.0
Time: 1.7s
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 r783504 = x;
        double r783505 = y;
        double r783506 = r783505 * r783505;
        double r783507 = exp(r783506);
        double r783508 = r783504 * r783507;
        return r783508;
}
↓
double f(double x, double y) {
        double r783509 = x;
        double r783510 = y;
        double r783511 = r783510 * r783510;
        double r783512 = exp(r783511);
        double r783513 = r783509 * r783512;
        return r783513;
}

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