Average Error: 0.0 → 0.0
Time: 1.3s
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 r223965 = x;
        double r223966 = y;
        double r223967 = r223965 * r223966;
        double r223968 = r223967 * r223966;
        double r223969 = exp(r223968);
        return r223969;
}
↓
double f(double x, double y) {
        double r223970 = x;
        double r223971 = y;
        double r223972 = r223970 * r223971;
        double r223973 = r223972 * r223971;
        double r223974 = exp(r223973);
        return r223974;
}

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