Average Error: 0.0 → 0.0
Time: 11.0s
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 r1788810 = re;
        double r1788811 = exp(r1788810);
        double r1788812 = im;
        double r1788813 = sin(r1788812);
        double r1788814 = r1788811 * r1788813;
        return r1788814;
}
↓
double f(double re, double im) {
        double r1788815 = im;
        double r1788816 = sin(r1788815);
        double r1788817 = re;
        double r1788818 = exp(r1788817);
        double r1788819 = r1788816 * r1788818;
        return r1788819;
}

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