Average Error: 0.0 → 0.0
Time: 1.7s
Precision: 64
\[x \cdot e^{y \cdot y}\]
↓
\[x \cdot e^{y \cdot y}\]
x \cdot e^{y \cdot y}
↓
x \cdot e^{y \cdot y}
double f(double x, double y) {
        double r2274153 = x;
        double r2274154 = y;
        double r2274155 = r2274154 * r2274154;
        double r2274156 = exp(r2274155);
        double r2274157 = r2274153 * r2274156;
        return r2274157;
}
↓
double f(double x, double y) {
        double r2274158 = x;
        double r2274159 = y;
        double r2274160 = r2274159 * r2274159;
        double r2274161 = exp(r2274160);
        double r2274162 = r2274158 * r2274161;
        return r2274162;
}

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 x \cdot e^{y \cdot y}\]

Reproduce

herbie shell --seed 2020018 +o rules:numerics
(FPCore (x y)
  :name "Data.Number.Erf:$dmerfcx from erf-2.0.0.0"
  :precision binary64

  :herbie-target
  (* x (pow (exp y) y))

  (* x (exp (* y y))))