Average Error: 0.0 → 0.0
Time: 30.0s
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)\]
\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 r482869 = c;
        double r482870 = sinh(r482869);
        double r482871 = -2.9807307601812193e+165;
        double r482872 = 2.0;
        double r482873 = pow(r482871, r482872);
        double r482874 = r482869 - r482873;
        double r482875 = fmod(r482870, r482874);
        return r482875;
}
↓
double f(double c) {
        double r482876 = c;
        double r482877 = sinh(r482876);
        double r482878 = -2.9807307601812193e+165;
        double r482879 = r482878 * r482878;
        double r482880 = r482876 - r482879;
        double r482881 = fmod(r482877, r482880);
        return r482881;
}

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 2019164 +o rules:numerics
(FPCore (c)
  :name "Random Jason Timeout Test 014"
  (fmod (sinh c) (- c (pow -2.9807307601812193e+165 2))))