Average Error: 0.0 → 0.0
Time: 12.1s
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 r1970852 = re;
        double r1970853 = exp(r1970852);
        double r1970854 = im;
        double r1970855 = sin(r1970854);
        double r1970856 = r1970853 * r1970855;
        return r1970856;
}
↓
double f(double re, double im) {
        double r1970857 = im;
        double r1970858 = sin(r1970857);
        double r1970859 = re;
        double r1970860 = exp(r1970859);
        double r1970861 = r1970858 * r1970860;
        return r1970861;
}

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 2019163 
(FPCore (re im)
  :name "math.exp on complex, imaginary part"
  (* (exp re) (sin im)))