Average Error: 0.0 → 0.0
Time: 16.6s
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 r767503 = x;
        double r767504 = y;
        double r767505 = r767504 * r767504;
        double r767506 = exp(r767505);
        double r767507 = r767503 * r767506;
        return r767507;
}
↓
double f(double x, double y) {
        double r767508 = x;
        double r767509 = y;
        double r767510 = r767509 * r767509;
        double r767511 = exp(r767510);
        double r767512 = r767508 * r767511;
        return r767512;
}

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