Average Error: 0.0 → 0.0
Time: 4.5s
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 r264767 = x;
        double r264768 = y;
        double r264769 = r264767 * r264768;
        double r264770 = r264769 * r264768;
        double r264771 = exp(r264770);
        return r264771;
}
↓
double f(double x, double y) {
        double r264772 = x;
        double r264773 = y;
        double r264774 = r264772 * r264773;
        double r264775 = r264774 * r264773;
        double r264776 = exp(r264775);
        return r264776;
}

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 
(FPCore (x y)
  :name "Data.Random.Distribution.Normal:normalF from random-fu-0.2.6.2"
  :precision binary64
  (exp (* (* x y) y)))