Average Error: 0.0 → 0.0
Time: 15.1s
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 r1596460 = re;
        double r1596461 = exp(r1596460);
        double r1596462 = im;
        double r1596463 = sin(r1596462);
        double r1596464 = r1596461 * r1596463;
        return r1596464;
}
↓
double f(double re, double im) {
        double r1596465 = im;
        double r1596466 = sin(r1596465);
        double r1596467 = re;
        double r1596468 = exp(r1596467);
        double r1596469 = r1596466 * r1596468;
        return r1596469;
}

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