Average Error: 0.0 → 0.0
Time: 3.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 r629396 = x;
        double r629397 = y;
        double r629398 = r629397 * r629397;
        double r629399 = exp(r629398);
        double r629400 = r629396 * r629399;
        return r629400;
}
↓
double f(double x, double y) {
        double r629401 = y;
        double r629402 = r629401 * r629401;
        double r629403 = exp(r629402);
        double r629404 = x;
        double r629405 = r629403 * r629404;
        return r629405;
}

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