Average Error: 0.0 → 0.0
Time: 16.0s
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 r877307 = x;
        double r877308 = y;
        double r877309 = r877308 * r877308;
        double r877310 = exp(r877309);
        double r877311 = r877307 * r877310;
        return r877311;
}
↓
double f(double x, double y) {
        double r877312 = x;
        double r877313 = y;
        double r877314 = r877313 * r877313;
        double r877315 = exp(r877314);
        double r877316 = r877312 * r877315;
        return r877316;
}

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