Average Error: 0.0 → 0.0
Time: 2.8s
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 r700704 = x;
        double r700705 = y;
        double r700706 = r700705 * r700705;
        double r700707 = exp(r700706);
        double r700708 = r700704 * r700707;
        return r700708;
}
↓
double f(double x, double y) {
        double r700709 = x;
        double r700710 = y;
        double r700711 = r700710 * r700710;
        double r700712 = exp(r700711);
        double r700713 = r700709 * r700712;
        return r700713;
}

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 2019304 
(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))))