Average Error: 0.0 → 0.0
Time: 15.4s
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 r1975438 = re;
        double r1975439 = exp(r1975438);
        double r1975440 = im;
        double r1975441 = sin(r1975440);
        double r1975442 = r1975439 * r1975441;
        return r1975442;
}
↓
double f(double re, double im) {
        double r1975443 = im;
        double r1975444 = sin(r1975443);
        double r1975445 = re;
        double r1975446 = exp(r1975445);
        double r1975447 = r1975444 * r1975446;
        return r1975447;
}

Error

Bits error versus re

Bits error versus im

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[e^{re} \cdot \sin im\]

  2. Final simplification0.0

    \[\leadsto \sin im \cdot e^{re}\]

Reproduce

herbie shell --seed 2019163 
(FPCore (re im)
  :name "math.exp on complex, imaginary part"
  (* (exp re) (sin im)))