Average Error: 0.0 → 0.0

Time: 8.9s

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 r808732 = re;
        double r808733 = exp(r808732);
        double r808734 = im;
        double r808735 = sin(r808734);
        double r808736 = r808733 * r808735;
        return r808736;
}

↓

double f(double re, double im) {
        double r808737 = im;
        double r808738 = sin(r808737);
        double r808739 = re;
        double r808740 = exp(r808739);
        double r808741 = r808738 * r808740;
        return r808741;
}

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