Average Error: 0.0 → 0.0
Time: 8.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 r935974 = x;
        double r935975 = y;
        double r935976 = r935975 * r935975;
        double r935977 = exp(r935976);
        double r935978 = r935974 * r935977;
        return r935978;
}
↓
double f(double x, double y) {
        double r935979 = x;
        double r935980 = y;
        double r935981 = r935980 * r935980;
        double r935982 = exp(r935981);
        double r935983 = r935979 * r935982;
        return r935983;
}

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