Average Error: 0.0 → 0.0
Time: 42.9s
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 r35575920 = x;
        double r35575921 = y;
        double r35575922 = r35575921 * r35575921;
        double r35575923 = exp(r35575922);
        double r35575924 = r35575920 * r35575923;
        return r35575924;
}
↓
double f(double x, double y) {
        double r35575925 = y;
        double r35575926 = r35575925 * r35575925;
        double r35575927 = exp(r35575926);
        double r35575928 = x;
        double r35575929 = r35575927 * r35575928;
        return r35575929;
}

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