Average Error: 0.0 → 0.0
Time: 2.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 r789799 = x;
        double r789800 = y;
        double r789801 = r789800 * r789800;
        double r789802 = exp(r789801);
        double r789803 = r789799 * r789802;
        return r789803;
}
↓
double f(double x, double y) {
        double r789804 = x;
        double r789805 = y;
        double r789806 = r789805 * r789805;
        double r789807 = exp(r789806);
        double r789808 = r789804 * r789807;
        return r789808;
}

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