Average Error: 0.0 → 0.0
Time: 958.0ms
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 r223825 = x;
        double r223826 = y;
        double r223827 = r223825 * r223826;
        double r223828 = r223827 * r223826;
        double r223829 = exp(r223828);
        return r223829;
}
↓
double f(double x, double y) {
        double r223830 = x;
        double r223831 = y;
        double r223832 = r223830 * r223831;
        double r223833 = r223832 * r223831;
        double r223834 = exp(r223833);
        return r223834;
}

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