Average Error: 0.0 → 0.0
Time: 13.8s
Precision: 64
\[e^{re} \cdot \sin im\]
↓
\[e^{re} \cdot \sin im\]
e^{re} \cdot \sin im
↓
e^{re} \cdot \sin im
double f(double re, double im) {
        double r3211905 = re;
        double r3211906 = exp(r3211905);
        double r3211907 = im;
        double r3211908 = sin(r3211907);
        double r3211909 = r3211906 * r3211908;
        return r3211909;
}
↓
double f(double re, double im) {
        double r3211910 = re;
        double r3211911 = exp(r3211910);
        double r3211912 = im;
        double r3211913 = sin(r3211912);
        double r3211914 = r3211911 * r3211913;
        return r3211914;
}

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 e^{re} \cdot \sin im\]

Reproduce

herbie shell --seed 2019174 +o rules:numerics
(FPCore (re im)
  :name "math.exp on complex, imaginary part"
  (* (exp re) (sin im)))