Average Error: 0.0 → 0.0
Time: 10.1s
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 r23200904 = x;
        double r23200905 = y;
        double r23200906 = r23200905 * r23200905;
        double r23200907 = exp(r23200906);
        double r23200908 = r23200904 * r23200907;
        return r23200908;
}
↓
double f(double x, double y) {
        double r23200909 = y;
        double r23200910 = r23200909 * r23200909;
        double r23200911 = exp(r23200910);
        double r23200912 = x;
        double r23200913 = r23200911 * r23200912;
        return r23200913;
}

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