Average Error: 0.0 → 0.0
Time: 8.9s
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 r3005114 = re;
        double r3005115 = exp(r3005114);
        double r3005116 = im;
        double r3005117 = sin(r3005116);
        double r3005118 = r3005115 * r3005117;
        return r3005118;
}
↓
double f(double re, double im) {
        double r3005119 = im;
        double r3005120 = sin(r3005119);
        double r3005121 = re;
        double r3005122 = exp(r3005121);
        double r3005123 = r3005120 * r3005122;
        return r3005123;
}

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