Average Error: 0.0 → 0.0
Time: 16.5s
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 r1799837 = re;
        double r1799838 = exp(r1799837);
        double r1799839 = im;
        double r1799840 = sin(r1799839);
        double r1799841 = r1799838 * r1799840;
        return r1799841;
}
↓
double f(double re, double im) {
        double r1799842 = im;
        double r1799843 = sin(r1799842);
        double r1799844 = re;
        double r1799845 = exp(r1799844);
        double r1799846 = r1799843 * r1799845;
        return r1799846;
}

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