Average Error: 0.0 → 0.0
Time: 11.1s
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 r816751 = x;
        double r816752 = y;
        double r816753 = r816752 * r816752;
        double r816754 = exp(r816753);
        double r816755 = r816751 * r816754;
        return r816755;
}
↓
double f(double x, double y) {
        double r816756 = x;
        double r816757 = y;
        double r816758 = r816757 * r816757;
        double r816759 = exp(r816758);
        double r816760 = r816756 * r816759;
        return r816760;
}

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