Average Error: 0.0 → 0.0
Time: 11.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 r1063709 = re;
        double r1063710 = exp(r1063709);
        double r1063711 = im;
        double r1063712 = sin(r1063711);
        double r1063713 = r1063710 * r1063712;
        return r1063713;
}
↓
double f(double re, double im) {
        double r1063714 = im;
        double r1063715 = sin(r1063714);
        double r1063716 = re;
        double r1063717 = exp(r1063716);
        double r1063718 = r1063715 * r1063717;
        return r1063718;
}

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 \sin im\]

  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2019134 +o rules:numerics
(FPCore (re im)
  :name "math.exp on complex, imaginary part"
  (* (exp re) (sin im)))