Average Error: 0.0 → 0.0
Time: 5.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 r193952 = x;
        double r193953 = y;
        double r193954 = r193952 * r193953;
        double r193955 = r193954 * r193953;
        double r193956 = exp(r193955);
        return r193956;
}
↓
double f(double x, double y) {
        double r193957 = x;
        double r193958 = y;
        double r193959 = r193957 * r193958;
        double r193960 = r193959 * r193958;
        double r193961 = exp(r193960);
        return r193961;
}

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