Average Error: 0.0 → 0.0
Time: 1.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 r1178 = x;
        double r1179 = y;
        double r1180 = r1178 * r1179;
        double r1181 = r1180 * r1179;
        double r1182 = exp(r1181);
        return r1182;
}
↓
double f(double x, double y) {
        double r1183 = x;
        double r1184 = y;
        double r1185 = r1183 * r1184;
        double r1186 = r1185 * r1184;
        double r1187 = exp(r1186);
        return r1187;
}

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