Average Error: 0.0 → 0.0
Time: 8.8s
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 r1008911 = re;
        double r1008912 = exp(r1008911);
        double r1008913 = im;
        double r1008914 = sin(r1008913);
        double r1008915 = r1008912 * r1008914;
        return r1008915;
}
↓
double f(double re, double im) {
        double r1008916 = im;
        double r1008917 = sin(r1008916);
        double r1008918 = re;
        double r1008919 = exp(r1008918);
        double r1008920 = r1008917 * r1008919;
        return r1008920;
}

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