Average Error: 0.0 → 0.0
Time: 15.4s
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 r1859484 = re;
        double r1859485 = exp(r1859484);
        double r1859486 = im;
        double r1859487 = sin(r1859486);
        double r1859488 = r1859485 * r1859487;
        return r1859488;
}
↓
double f(double re, double im) {
        double r1859489 = im;
        double r1859490 = sin(r1859489);
        double r1859491 = re;
        double r1859492 = exp(r1859491);
        double r1859493 = r1859490 * r1859492;
        return r1859493;
}

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