Average Error: 0.0 → 0.0
Time: 2.4s
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 r735081 = x;
        double r735082 = y;
        double r735083 = r735082 * r735082;
        double r735084 = exp(r735083);
        double r735085 = r735081 * r735084;
        return r735085;
}
↓
double f(double x, double y) {
        double r735086 = x;
        double r735087 = y;
        double r735088 = r735087 * r735087;
        double r735089 = exp(r735088);
        double r735090 = r735086 * r735089;
        return r735090;
}

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