Average Error: 0.0 → 0.0
Time: 19.6s
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 r39899211 = x;
        double r39899212 = y;
        double r39899213 = r39899212 * r39899212;
        double r39899214 = exp(r39899213);
        double r39899215 = r39899211 * r39899214;
        return r39899215;
}
↓
double f(double x, double y) {
        double r39899216 = y;
        double r39899217 = r39899216 * r39899216;
        double r39899218 = exp(r39899217);
        double r39899219 = x;
        double r39899220 = r39899218 * r39899219;
        return r39899220;
}

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