Average Error: 0.0 → 0.0
Time: 9.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 r505875 = x;
        double r505876 = y;
        double r505877 = r505876 * r505876;
        double r505878 = exp(r505877);
        double r505879 = r505875 * r505878;
        return r505879;
}
↓
double f(double x, double y) {
        double r505880 = x;
        double r505881 = y;
        double r505882 = r505881 * r505881;
        double r505883 = exp(r505882);
        double r505884 = r505880 * r505883;
        return r505884;
}

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