Average Error: 0.0 → 0.0
Time: 12.4s
Precision: 64
\[e^{\left(x \cdot y\right) \cdot y}\]
↓
\[e^{\left(x \cdot y\right) \cdot y}\]
e^{\left(x \cdot y\right) \cdot y}
↓
e^{\left(x \cdot y\right) \cdot y}
double f(double x, double y) {
        double r135360 = x;
        double r135361 = y;
        double r135362 = r135360 * r135361;
        double r135363 = r135362 * r135361;
        double r135364 = exp(r135363);
        return r135364;
}
↓
double f(double x, double y) {
        double r135365 = x;
        double r135366 = y;
        double r135367 = r135365 * r135366;
        double r135368 = r135367 * r135366;
        double r135369 = exp(r135368);
        return r135369;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[e^{\left(x \cdot y\right) \cdot y}\]

  2. Final simplification0.0

    \[\leadsto e^{\left(x \cdot y\right) \cdot y}\]

Reproduce

herbie shell --seed 2019304 +o rules:numerics
(FPCore (x y)
  :name "Data.Random.Distribution.Normal:normalF from random-fu-0.2.6.2"
  :precision binary64
  (exp (* (* x y) y)))