Average Error: 0.0 → 0.0
Time: 1.3s
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 r797205 = x;
        double r797206 = y;
        double r797207 = r797206 * r797206;
        double r797208 = exp(r797207);
        double r797209 = r797205 * r797208;
        return r797209;
}
↓
double f(double x, double y) {
        double r797210 = x;
        double r797211 = y;
        double r797212 = r797211 * r797211;
        double r797213 = exp(r797212);
        double r797214 = r797210 * r797213;
        return r797214;
}

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