Average Error: 0.0 → 0.0

Time: 9.4s

Precision: 64

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

↓

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

e^{re} \cdot \sin im

↓

\sin im \cdot e^{re}

double f(double re, double im) {
        double r859977 = re;
        double r859978 = exp(r859977);
        double r859979 = im;
        double r859980 = sin(r859979);
        double r859981 = r859978 * r859980;
        return r859981;
}

↓

double f(double re, double im) {
        double r859982 = im;
        double r859983 = sin(r859982);
        double r859984 = re;
        double r859985 = exp(r859984);
        double r859986 = r859983 * r859985;
        return r859986;
}

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 \sin im\]
Final simplification0.0
\[\leadsto \sin im \cdot e^{re}\]

Reproduce

herbie shell --seed 2019155 
(FPCore (re im)
  :name "math.exp on complex, imaginary part"
  (* (exp re) (sin im)))