Average Error: 0.0 → 0.0

Time: 4.1s

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 r850605 = re;
        double r850606 = exp(r850605);
        double r850607 = im;
        double r850608 = sin(r850607);
        double r850609 = r850606 * r850608;
        return r850609;
}

↓

double f(double re, double im) {
        double r850610 = im;
        double r850611 = sin(r850610);
        double r850612 = re;
        double r850613 = exp(r850612);
        double r850614 = r850611 * r850613;
        return r850614;
}

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