Average Error: 0.0 → 0.0
Time: 9.6s
Precision: 64
\[x \cdot e^{y \cdot y}\]
↓
\[e^{y \cdot y} \cdot x\]
x \cdot e^{y \cdot y}
↓
e^{y \cdot y} \cdot x
double f(double x, double y) {
        double r25943597 = x;
        double r25943598 = y;
        double r25943599 = r25943598 * r25943598;
        double r25943600 = exp(r25943599);
        double r25943601 = r25943597 * r25943600;
        return r25943601;
}
↓
double f(double x, double y) {
        double r25943602 = y;
        double r25943603 = r25943602 * r25943602;
        double r25943604 = exp(r25943603);
        double r25943605 = x;
        double r25943606 = r25943604 * r25943605;
        return r25943606;
}

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 e^{y \cdot y} \cdot x\]

Reproduce

herbie shell --seed 2019162 +o rules:numerics
(FPCore (x y)
  :name "Data.Number.Erf:$dmerfcx from erf-2.0.0.0"

  :herbie-target
  (* x (pow (exp y) y))

  (* x (exp (* y y))))