Average Error: 0.0 → 0.0
Time: 2.6s
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 r46377 = re;
        double r46378 = exp(r46377);
        double r46379 = im;
        double r46380 = cos(r46379);
        double r46381 = r46378 * r46380;
        return r46381;
}
↓
double f(double re, double im) {
        double r46382 = re;
        double r46383 = exp(r46382);
        double r46384 = im;
        double r46385 = cos(r46384);
        double r46386 = r46383 * r46385;
        return r46386;
}

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