Average Error: 0.0 → 0.0
Time: 13.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 r1126513 = re;
        double r1126514 = exp(r1126513);
        double r1126515 = im;
        double r1126516 = sin(r1126515);
        double r1126517 = r1126514 * r1126516;
        return r1126517;
}
↓
double f(double re, double im) {
        double r1126518 = im;
        double r1126519 = sin(r1126518);
        double r1126520 = re;
        double r1126521 = exp(r1126520);
        double r1126522 = r1126519 * r1126521;
        return r1126522;
}

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)))