Average Error: 0.0 → 0.0

Time: 7.7s

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 r687354 = re;
        double r687355 = exp(r687354);
        double r687356 = im;
        double r687357 = sin(r687356);
        double r687358 = r687355 * r687357;
        return r687358;
}

↓

double f(double re, double im) {
        double r687359 = im;
        double r687360 = sin(r687359);
        double r687361 = re;
        double r687362 = exp(r687361);
        double r687363 = r687360 * r687362;
        return r687363;
}

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