Average Error: 0.0 → 0.0
Time: 8.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 r211111 = x;
        double r211112 = y;
        double r211113 = r211111 * r211112;
        double r211114 = r211113 * r211112;
        double r211115 = exp(r211114);
        return r211115;
}
↓
double f(double x, double y) {
        double r211116 = x;
        double r211117 = y;
        double r211118 = r211116 * r211117;
        double r211119 = r211118 * r211117;
        double r211120 = exp(r211119);
        return r211120;
}

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