Average Error: 0.0 → 0.0
Time: 9.2s
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 r36717668 = x;
        double r36717669 = y;
        double r36717670 = r36717669 * r36717669;
        double r36717671 = exp(r36717670);
        double r36717672 = r36717668 * r36717671;
        return r36717672;
}
↓
double f(double x, double y) {
        double r36717673 = y;
        double r36717674 = r36717673 * r36717673;
        double r36717675 = exp(r36717674);
        double r36717676 = x;
        double r36717677 = r36717675 * r36717676;
        return r36717677;
}

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