Average Error: 0.0 → 0.0
Time: 11.7s
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 r1246344 = re;
        double r1246345 = exp(r1246344);
        double r1246346 = im;
        double r1246347 = sin(r1246346);
        double r1246348 = r1246345 * r1246347;
        return r1246348;
}
↓
double f(double re, double im) {
        double r1246349 = im;
        double r1246350 = sin(r1246349);
        double r1246351 = re;
        double r1246352 = exp(r1246351);
        double r1246353 = r1246350 * r1246352;
        return r1246353;
}

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