Average Error: 0.0 → 0.0

Time: 12.5s

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 r848112 = re;
        double r848113 = exp(r848112);
        double r848114 = im;
        double r848115 = sin(r848114);
        double r848116 = r848113 * r848115;
        return r848116;
}

↓

double f(double re, double im) {
        double r848117 = im;
        double r848118 = sin(r848117);
        double r848119 = re;
        double r848120 = exp(r848119);
        double r848121 = r848118 * r848120;
        return r848121;
}

Error

The X axis uses an exponential scale — Bits error versus `re`

Try it out

In
Out

Enter valid numbers for all inputs

Derivation

Initial program 0.0
\[e^{re} \cdot \sin im\]
Final simplification0.0
\[\leadsto \sin im \cdot e^{re}\]

Reproduce

herbie shell --seed 2019133 
(FPCore (re im)
  :name "math.exp on complex, imaginary part"
  (* (exp re) (sin im)))