Average Error: 0.0 → 0.0
Time: 2.2s
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 r88148 = re;
        double r88149 = exp(r88148);
        double r88150 = im;
        double r88151 = cos(r88150);
        double r88152 = r88149 * r88151;
        return r88152;
}
↓
double f(double re, double im) {
        double r88153 = re;
        double r88154 = exp(r88153);
        double r88155 = im;
        double r88156 = cos(r88155);
        double r88157 = r88154 * r88156;
        return r88157;
}

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