Average Error: 0.0 → 0.0
Time: 14.7s
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 r2205096 = re;
        double r2205097 = exp(r2205096);
        double r2205098 = im;
        double r2205099 = sin(r2205098);
        double r2205100 = r2205097 * r2205099;
        return r2205100;
}
↓
double f(double re, double im) {
        double r2205101 = im;
        double r2205102 = sin(r2205101);
        double r2205103 = re;
        double r2205104 = exp(r2205103);
        double r2205105 = r2205102 * r2205104;
        return r2205105;
}

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