Average Error: 0.0 → 0.0
Time: 3.0s
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 r221686 = x;
        double r221687 = y;
        double r221688 = r221686 * r221687;
        double r221689 = r221688 * r221687;
        double r221690 = exp(r221689);
        return r221690;
}
↓
double f(double x, double y) {
        double r221691 = x;
        double r221692 = y;
        double r221693 = r221691 * r221692;
        double r221694 = r221693 * r221692;
        double r221695 = exp(r221694);
        return r221695;
}

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