Average Error: 0.0 → 0.0

Time: 6.8s

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 r683965 = re;
        double r683966 = exp(r683965);
        double r683967 = im;
        double r683968 = sin(r683967);
        double r683969 = r683966 * r683968;
        return r683969;
}

↓

double f(double re, double im) {
        double r683970 = im;
        double r683971 = sin(r683970);
        double r683972 = re;
        double r683973 = exp(r683972);
        double r683974 = r683971 * r683973;
        return r683974;
}

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 2019153 
(FPCore (re im)
  :name "math.exp on complex, imaginary part"
  (* (exp re) (sin im)))