Average Error: 0.0 → 0.0
Time: 23.5s
Precision: 64
\[\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.9807307601812193 \cdot 10^{+165} \right)}^{2}\right)\right)\]
↓
\[\left(\left(\sinh c\right) \bmod \left(c - -2.9807307601812193 \cdot 10^{+165} \cdot -2.9807307601812193 \cdot 10^{+165}\right)\right)\]
double f(double c) {
        double r1061232 = c;
        double r1061233 = sinh(r1061232);
        double r1061234 = -2.9807307601812193e+165;
        double r1061235 = 2.0;
        double r1061236 = pow(r1061234, r1061235);
        double r1061237 = r1061232 - r1061236;
        double r1061238 = fmod(r1061233, r1061237);
        return r1061238;
}
↓
double f(double c) {
        double r1061239 = c;
        double r1061240 = sinh(r1061239);
        double r1061241 = -2.9807307601812193e+165;
        double r1061242 = r1061241 * r1061241;
        double r1061243 = r1061239 - r1061242;
        double r1061244 = fmod(r1061240, r1061243);
        return r1061244;
}


\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.9807307601812193 \cdot 10^{+165} \right)}^{2}\right)\right)
↓
\left(\left(\sinh c\right) \bmod \left(c - -2.9807307601812193 \cdot 10^{+165} \cdot -2.9807307601812193 \cdot 10^{+165}\right)\right)

Error

Bits error versus c

Derivation

  1. Initial program 0.0

    \[\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.9807307601812193 \cdot 10^{+165} \right)}^{2}\right)\right)\]

  2. Simplified0.0

    \[\leadsto \color{blue}{\left(\left(\sinh c\right) \bmod \left(c - -2.9807307601812193 \cdot 10^{+165} \cdot -2.9807307601812193 \cdot 10^{+165}\right)\right)}\]

  3. Final simplification0.0

    \[\leadsto \left(\left(\sinh c\right) \bmod \left(c - -2.9807307601812193 \cdot 10^{+165} \cdot -2.9807307601812193 \cdot 10^{+165}\right)\right)\]

Reproduce

herbie shell --seed 2019102 +o rules:numerics
(FPCore (c)
  :name "Random Jason Timeout Test 002"
  (fmod (sinh c) (- c (pow -2.9807307601812193e+165 2))))