Average Error: 0.0 → 0.0

Time: 12.4s

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 r39213 = re;
        double r39214 = exp(r39213);
        double r39215 = im;
        double r39216 = sin(r39215);
        double r39217 = r39214 * r39216;
        return r39217;
}

↓

double f(double re, double im) {
        double r39218 = im;
        double r39219 = sin(r39218);
        double r39220 = re;
        double r39221 = exp(r39220);
        double r39222 = r39219 * r39221;
        return r39222;
}

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