Average Error: 0.0 → 0.0
Time: 6.3s
Precision: 64
\[e^{re} \cdot \cos im\]
↓
\[e^{re} \cdot \cos im\]
e^{re} \cdot \cos im
↓
e^{re} \cdot \cos im
double f(double re, double im) {
        double r25711 = re;
        double r25712 = exp(r25711);
        double r25713 = im;
        double r25714 = cos(r25713);
        double r25715 = r25712 * r25714;
        return r25715;
}
↓
double f(double re, double im) {
        double r25716 = re;
        double r25717 = exp(r25716);
        double r25718 = im;
        double r25719 = cos(r25718);
        double r25720 = r25717 * r25719;
        return r25720;
}

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 \cos im\]

  2. Final simplification0.0

    \[\leadsto e^{re} \cdot \cos im\]

Reproduce

herbie shell --seed 2019235 
(FPCore (re im)
  :name "math.exp on complex, real part"
  :precision binary64
  (* (exp re) (cos im)))