Average Error: 0.0 → 0.0
Time: 2.6s
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 r193025 = x;
        double r193026 = y;
        double r193027 = r193025 * r193026;
        double r193028 = r193027 * r193026;
        double r193029 = exp(r193028);
        return r193029;
}
↓
double f(double x, double y) {
        double r193030 = x;
        double r193031 = y;
        double r193032 = r193030 * r193031;
        double r193033 = r193032 * r193031;
        double r193034 = exp(r193033);
        return r193034;
}

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