Average Error: 0.0 → 0.0
Time: 6.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 r1171004 = re;
        double r1171005 = exp(r1171004);
        double r1171006 = im;
        double r1171007 = sin(r1171006);
        double r1171008 = r1171005 * r1171007;
        return r1171008;
}
↓
double f(double re, double im) {
        double r1171009 = im;
        double r1171010 = sin(r1171009);
        double r1171011 = re;
        double r1171012 = exp(r1171011);
        double r1171013 = r1171010 * r1171012;
        return r1171013;
}

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