Average Error: 0.0 → 0.0

Time: 12.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 r35759 = re;
        double r35760 = exp(r35759);
        double r35761 = im;
        double r35762 = sin(r35761);
        double r35763 = r35760 * r35762;
        return r35763;
}

↓

double f(double re, double im) {
        double r35764 = im;
        double r35765 = sin(r35764);
        double r35766 = re;
        double r35767 = exp(r35766);
        double r35768 = r35765 * r35767;
        return r35768;
}

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