Average Error: 0.0 → 0.0
Time: 3.1s
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 r56941 = re;
        double r56942 = exp(r56941);
        double r56943 = im;
        double r56944 = cos(r56943);
        double r56945 = r56942 * r56944;
        return r56945;
}
↓
double f(double re, double im) {
        double r56946 = re;
        double r56947 = exp(r56946);
        double r56948 = im;
        double r56949 = cos(r56948);
        double r56950 = r56947 * r56949;
        return r56950;
}

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