Average Error: 0.0 → 0.0
Time: 13.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 r538490 = x;
        double r538491 = y;
        double r538492 = r538491 * r538491;
        double r538493 = exp(r538492);
        double r538494 = r538490 * r538493;
        return r538494;
}
↓
double f(double x, double y) {
        double r538495 = x;
        double r538496 = y;
        double r538497 = r538496 * r538496;
        double r538498 = exp(r538497);
        double r538499 = r538495 * r538498;
        return r538499;
}

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