Average Error: 0.0 → 0.0
Time: 3.7s
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 r49998 = re;
        double r49999 = exp(r49998);
        double r50000 = im;
        double r50001 = sin(r50000);
        double r50002 = r49999 * r50001;
        return r50002;
}
↓
double f(double re, double im) {
        double r50003 = re;
        double r50004 = exp(r50003);
        double r50005 = im;
        double r50006 = sin(r50005);
        double r50007 = r50004 * r50006;
        return r50007;
}

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