Average Error: 0.0 → 0.0
Time: 2.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 r754529 = x;
        double r754530 = y;
        double r754531 = r754530 * r754530;
        double r754532 = exp(r754531);
        double r754533 = r754529 * r754532;
        return r754533;
}
↓
double f(double x, double y) {
        double r754534 = x;
        double r754535 = y;
        double r754536 = r754535 * r754535;
        double r754537 = exp(r754536);
        double r754538 = r754534 * r754537;
        return r754538;
}

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