Average Error: 0.0 → 0.0
Time: 2.0s
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 r37133 = re;
        double r37134 = exp(r37133);
        double r37135 = im;
        double r37136 = cos(r37135);
        double r37137 = r37134 * r37136;
        return r37137;
}
↓
double f(double re, double im) {
        double r37138 = re;
        double r37139 = exp(r37138);
        double r37140 = im;
        double r37141 = cos(r37140);
        double r37142 = r37139 * r37141;
        return r37142;
}

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