Average Error: 0.0 → 0.0
Time: 23.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 r2168143 = re;
        double r2168144 = exp(r2168143);
        double r2168145 = im;
        double r2168146 = sin(r2168145);
        double r2168147 = r2168144 * r2168146;
        return r2168147;
}
↓
double f(double re, double im) {
        double r2168148 = im;
        double r2168149 = sin(r2168148);
        double r2168150 = re;
        double r2168151 = exp(r2168150);
        double r2168152 = r2168149 * r2168151;
        return r2168152;
}

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