Average Error: 0.0 → 0.0
Time: 4.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 r943003 = x;
        double r943004 = y;
        double r943005 = r943004 * r943004;
        double r943006 = exp(r943005);
        double r943007 = r943003 * r943006;
        return r943007;
}
↓
double f(double x, double y) {
        double r943008 = x;
        double r943009 = y;
        double r943010 = r943009 * r943009;
        double r943011 = exp(r943010);
        double r943012 = r943008 * r943011;
        return r943012;
}

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