Average Error: 0.0 → 0.0
Time: 23.6s
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 r1061216 = c;
        double r1061217 = sinh(r1061216);
        double r1061218 = -2.9807307601812193e+165;
        double r1061219 = 2.0;
        double r1061220 = pow(r1061218, r1061219);
        double r1061221 = r1061216 - r1061220;
        double r1061222 = fmod(r1061217, r1061221);
        return r1061222;
}
↓
double f(double c) {
        double r1061223 = c;
        double r1061224 = sinh(r1061223);
        double r1061225 = -2.9807307601812193e+165;
        double r1061226 = r1061225 * r1061225;
        double r1061227 = r1061223 - r1061226;
        double r1061228 = fmod(r1061224, r1061227);
        return r1061228;
}


\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 014"
  (fmod (sinh c) (- c (pow -2.9807307601812193e+165 2))))