Average Error: 0.0 → 0.1
Time: 9.8s
Precision: 64
\[e^{\left(x \cdot y\right) \cdot y}\]
↓
\[\mathsf{log1p}\left(\mathsf{expm1}\left(e^{\left(x \cdot y\right) \cdot y}\right)\right)\]
e^{\left(x \cdot y\right) \cdot y}
↓
\mathsf{log1p}\left(\mathsf{expm1}\left(e^{\left(x \cdot y\right) \cdot y}\right)\right)
double f(double x, double y) {
        double r184496 = x;
        double r184497 = y;
        double r184498 = r184496 * r184497;
        double r184499 = r184498 * r184497;
        double r184500 = exp(r184499);
        return r184500;
}
↓
double f(double x, double y) {
        double r184501 = x;
        double r184502 = y;
        double r184503 = r184501 * r184502;
        double r184504 = r184503 * r184502;
        double r184505 = exp(r184504);
        double r184506 = expm1(r184505);
        double r184507 = log1p(r184506);
        return r184507;
}

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. Using strategy rm

  3. Applied log1p-expm1-u0.1

    \[\leadsto \color{blue}{\mathsf{log1p}\left(\mathsf{expm1}\left(e^{\left(x \cdot y\right) \cdot y}\right)\right)}\]

  4. Final simplification0.1

    \[\leadsto \mathsf{log1p}\left(\mathsf{expm1}\left(e^{\left(x \cdot y\right) \cdot y}\right)\right)\]

Reproduce

herbie shell --seed 2020046 +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)))