Average Error: 0.0 → 0.0
Time: 9.9s
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 r1341998 = re;
        double r1341999 = exp(r1341998);
        double r1342000 = im;
        double r1342001 = sin(r1342000);
        double r1342002 = r1341999 * r1342001;
        return r1342002;
}
↓
double f(double re, double im) {
        double r1342003 = im;
        double r1342004 = sin(r1342003);
        double r1342005 = re;
        double r1342006 = exp(r1342005);
        double r1342007 = r1342004 * r1342006;
        return r1342007;
}

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