Average Error: 0.0 → 0.0
Time: 14.5s
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 r1414266 = x;
        double r1414267 = y;
        double r1414268 = r1414267 * r1414267;
        double r1414269 = exp(r1414268);
        double r1414270 = r1414266 * r1414269;
        return r1414270;
}
↓
double f(double x, double y) {
        double r1414271 = x;
        double r1414272 = y;
        double r1414273 = r1414272 * r1414272;
        double r1414274 = exp(r1414273);
        double r1414275 = r1414271 * r1414274;
        return r1414275;
}

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