Average Error: 0.0 → 0.0
Time: 25.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 r447330 = x;
        double r447331 = y;
        double r447332 = r447331 * r447331;
        double r447333 = exp(r447332);
        double r447334 = r447330 * r447333;
        return r447334;
}
↓
double f(double x, double y) {
        double r447335 = x;
        double r447336 = y;
        double r447337 = r447336 * r447336;
        double r447338 = exp(r447337);
        double r447339 = r447335 * r447338;
        return r447339;
}

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