Average Error: 0.0 → 0.0

Time: 7.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 r46305 = re;
        double r46306 = exp(r46305);
        double r46307 = im;
        double r46308 = sin(r46307);
        double r46309 = r46306 * r46308;
        return r46309;
}

↓

double f(double re, double im) {
        double r46310 = im;
        double r46311 = sin(r46310);
        double r46312 = re;
        double r46313 = exp(r46312);
        double r46314 = r46311 * r46313;
        return r46314;
}

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