Average Error: 0.0 → 0.0
Time: 7.7s
Precision: 64
\[e^{re} \cdot \sin im\]
↓
\[\sin im \cdot e^{re}\]
e^{re} \cdot \sin im
↓
\sin im \cdot e^{re}
double f(double re, double im) {
        double r1706892 = re;
        double r1706893 = exp(r1706892);
        double r1706894 = im;
        double r1706895 = sin(r1706894);
        double r1706896 = r1706893 * r1706895;
        return r1706896;
}
↓
double f(double re, double im) {
        double r1706897 = im;
        double r1706898 = sin(r1706897);
        double r1706899 = re;
        double r1706900 = exp(r1706899);
        double r1706901 = r1706898 * r1706900;
        return r1706901;
}

Error

Bits error versus re

Bits error versus im

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[e^{re} \cdot \sin im\]

  2. Final simplification0.0

    \[\leadsto \sin im \cdot e^{re}\]

Reproduce

herbie shell --seed 2019165 +o rules:numerics
(FPCore (re im)
  :name "math.exp on complex, imaginary part"
  (* (exp re) (sin im)))