Average Error: 0.0 → 0.0
Time: 6.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 r55069 = re;
        double r55070 = exp(r55069);
        double r55071 = im;
        double r55072 = cos(r55071);
        double r55073 = r55070 * r55072;
        return r55073;
}
↓
double f(double re, double im) {
        double r55074 = re;
        double r55075 = exp(r55074);
        double r55076 = im;
        double r55077 = cos(r55076);
        double r55078 = r55075 * r55077;
        return r55078;
}

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)))