Average Error: 0.0 → 0.0
Time: 18.7s
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 r1327816 = re;
        double r1327817 = exp(r1327816);
        double r1327818 = im;
        double r1327819 = sin(r1327818);
        double r1327820 = r1327817 * r1327819;
        return r1327820;
}
↓
double f(double re, double im) {
        double r1327821 = im;
        double r1327822 = sin(r1327821);
        double r1327823 = re;
        double r1327824 = exp(r1327823);
        double r1327825 = r1327822 * r1327824;
        return r1327825;
}

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