Average Error: 0.0 → 0.0

Time: 7.1s

Precision: 64

\[e^{re} \cdot \cos im\]

↓

\[\cos im \cdot e^{re}\]

e^{re} \cdot \cos im

↓

\cos im \cdot e^{re}

double f(double re, double im) {
        double r877388 = re;
        double r877389 = exp(r877388);
        double r877390 = im;
        double r877391 = cos(r877390);
        double r877392 = r877389 * r877391;
        return r877392;
}

↓

double f(double re, double im) {
        double r877393 = im;
        double r877394 = cos(r877393);
        double r877395 = re;
        double r877396 = exp(r877395);
        double r877397 = r877394 * r877396;
        return r877397;
}

Error

The X axis uses an exponential scale — Bits error versus `re`

Try it out

In
Out

Enter valid numbers for all inputs

Derivation

Initial program 0.0
\[e^{re} \cdot \cos im\]
Final simplification0.0
\[\leadsto \cos im \cdot e^{re}\]

Reproduce

herbie shell --seed 2019153 
(FPCore (re im)
  :name "math.exp on complex, real part"
  (* (exp re) (cos im)))