Average Error: 0.0 → 0.0
Time: 10.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 r824122 = x;
        double r824123 = y;
        double r824124 = r824123 * r824123;
        double r824125 = exp(r824124);
        double r824126 = r824122 * r824125;
        return r824126;
}
↓
double f(double x, double y) {
        double r824127 = x;
        double r824128 = y;
        double r824129 = r824128 * r824128;
        double r824130 = exp(r824129);
        double r824131 = r824127 * r824130;
        return r824131;
}

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