Average Error: 0.0 → 0.0
Time: 13.3s
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 r1337793 = re;
        double r1337794 = exp(r1337793);
        double r1337795 = im;
        double r1337796 = sin(r1337795);
        double r1337797 = r1337794 * r1337796;
        return r1337797;
}
↓
double f(double re, double im) {
        double r1337798 = im;
        double r1337799 = sin(r1337798);
        double r1337800 = re;
        double r1337801 = exp(r1337800);
        double r1337802 = r1337799 * r1337801;
        return r1337802;
}

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