Average Error: 0.0 → 0.0
Time: 2.4s
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 r759046 = x;
        double r759047 = y;
        double r759048 = r759047 * r759047;
        double r759049 = exp(r759048);
        double r759050 = r759046 * r759049;
        return r759050;
}
↓
double f(double x, double y) {
        double r759051 = x;
        double r759052 = y;
        double r759053 = r759052 * r759052;
        double r759054 = exp(r759053);
        double r759055 = r759051 * r759054;
        return r759055;
}

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