Average Error: 0.0 → 0.0
Time: 5.0s
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 r8323535 = x;
        double r8323536 = y;
        double r8323537 = r8323536 * r8323536;
        double r8323538 = exp(r8323537);
        double r8323539 = r8323535 * r8323538;
        return r8323539;
}
↓
double f(double x, double y) {
        double r8323540 = y;
        double r8323541 = r8323540 * r8323540;
        double r8323542 = exp(r8323541);
        double r8323543 = x;
        double r8323544 = r8323542 * r8323543;
        return r8323544;
}

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