Average Error: 0.0 → 0.0
Time: 6.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 r1451269 = re;
        double r1451270 = exp(r1451269);
        double r1451271 = im;
        double r1451272 = sin(r1451271);
        double r1451273 = r1451270 * r1451272;
        return r1451273;
}
↓
double f(double re, double im) {
        double r1451274 = im;
        double r1451275 = sin(r1451274);
        double r1451276 = re;
        double r1451277 = exp(r1451276);
        double r1451278 = r1451275 * r1451277;
        return r1451278;
}

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