Average Error: 0.0 → 0.0
Time: 17.7s
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 r34489152 = x;
        double r34489153 = y;
        double r34489154 = r34489153 * r34489153;
        double r34489155 = exp(r34489154);
        double r34489156 = r34489152 * r34489155;
        return r34489156;
}
↓
double f(double x, double y) {
        double r34489157 = y;
        double r34489158 = r34489157 * r34489157;
        double r34489159 = exp(r34489158);
        double r34489160 = x;
        double r34489161 = r34489159 * r34489160;
        return r34489161;
}

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