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 r36770341 = x;
        double r36770342 = y;
        double r36770343 = r36770342 * r36770342;
        double r36770344 = exp(r36770343);
        double r36770345 = r36770341 * r36770344;
        return r36770345;
}
↓
double f(double x, double y) {
        double r36770346 = y;
        double r36770347 = r36770346 * r36770346;
        double r36770348 = exp(r36770347);
        double r36770349 = x;
        double r36770350 = r36770348 * r36770349;
        return r36770350;
}

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