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 r1857838 = re;
        double r1857839 = exp(r1857838);
        double r1857840 = im;
        double r1857841 = sin(r1857840);
        double r1857842 = r1857839 * r1857841;
        return r1857842;
}
↓
double f(double re, double im) {
        double r1857843 = im;
        double r1857844 = sin(r1857843);
        double r1857845 = re;
        double r1857846 = exp(r1857845);
        double r1857847 = r1857844 * r1857846;
        return r1857847;
}

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