Average Error: 0.0 → 0.0
Time: 21.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 r35858170 = x;
        double r35858171 = y;
        double r35858172 = r35858171 * r35858171;
        double r35858173 = exp(r35858172);
        double r35858174 = r35858170 * r35858173;
        return r35858174;
}
↓
double f(double x, double y) {
        double r35858175 = y;
        double r35858176 = r35858175 * r35858175;
        double r35858177 = exp(r35858176);
        double r35858178 = x;
        double r35858179 = r35858177 * r35858178;
        return r35858179;
}

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