Average Error: 0.0 → 0.0

Time: 6.2s

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 r895288 = re;
        double r895289 = exp(r895288);
        double r895290 = im;
        double r895291 = sin(r895290);
        double r895292 = r895289 * r895291;
        return r895292;
}

↓

double f(double re, double im) {
        double r895293 = im;
        double r895294 = sin(r895293);
        double r895295 = re;
        double r895296 = exp(r895295);
        double r895297 = r895294 * r895296;
        return r895297;
}

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