Average Error: 0.0 → 0.0

Time: 7.6s

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 r892958 = re;
        double r892959 = exp(r892958);
        double r892960 = im;
        double r892961 = sin(r892960);
        double r892962 = r892959 * r892961;
        return r892962;
}

↓

double f(double re, double im) {
        double r892963 = im;
        double r892964 = sin(r892963);
        double r892965 = re;
        double r892966 = exp(r892965);
        double r892967 = r892964 * r892966;
        return r892967;
}

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