Average Error: 0.0 → 0.0
Time: 3.8s
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 r256295 = x;
        double r256296 = y;
        double r256297 = r256295 * r256296;
        double r256298 = r256297 * r256296;
        double r256299 = exp(r256298);
        return r256299;
}
↓
double f(double x, double y) {
        double r256300 = x;
        double r256301 = y;
        double r256302 = r256300 * r256301;
        double r256303 = r256302 * r256301;
        double r256304 = exp(r256303);
        return r256304;
}

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