Average Error: 0.0 → 0.0
Time: 7.4s
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 r41233 = re;
        double r41234 = exp(r41233);
        double r41235 = im;
        double r41236 = cos(r41235);
        double r41237 = r41234 * r41236;
        return r41237;
}
↓
double f(double re, double im) {
        double r41238 = re;
        double r41239 = exp(r41238);
        double r41240 = im;
        double r41241 = cos(r41240);
        double r41242 = r41239 * r41241;
        return r41242;
}

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