Average Error: 0.0 → 0.0
Time: 10.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 r1227084 = re;
        double r1227085 = exp(r1227084);
        double r1227086 = im;
        double r1227087 = sin(r1227086);
        double r1227088 = r1227085 * r1227087;
        return r1227088;
}
↓
double f(double re, double im) {
        double r1227089 = im;
        double r1227090 = sin(r1227089);
        double r1227091 = re;
        double r1227092 = exp(r1227091);
        double r1227093 = r1227090 * r1227092;
        return r1227093;
}

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