Average Error: 33.9 → 33.9
Time: 27.5s
Precision: 64
\[\left(\left(\cosh c\right) \bmod \left(\log_* (1 + a)\right)\right)\]
\[\left(\left(\cosh c\right) \bmod \left(\log_* (1 + a)\right)\right)\]
\left(\left(\cosh c\right) \bmod \left(\log_* (1 + a)\right)\right)
\left(\left(\cosh c\right) \bmod \left(\log_* (1 + a)\right)\right)
double f(double a, double c) {
        double r105334 = c;
        double r105335 = cosh(r105334);
        double r105336 = a;
        double r105337 = log1p(r105336);
        double r105338 = fmod(r105335, r105337);
        return r105338;
}

double f(double a, double c) {
        double r105339 = c;
        double r105340 = cosh(r105339);
        double r105341 = a;
        double r105342 = log1p(r105341);
        double r105343 = fmod(r105340, r105342);
        return r105343;
}

Error

Bits error versus a

Bits error versus c

Derivation

  1. Initial program 33.9

    \[\left(\left(\cosh c\right) \bmod \left(\log_* (1 + a)\right)\right)\]
  2. Final simplification33.9

    \[\leadsto \left(\left(\cosh c\right) \bmod \left(\log_* (1 + a)\right)\right)\]

Reproduce

herbie shell --seed 2019104 +o rules:numerics
(FPCore (a c)
  :name "Random Jason Timeout Test 004"
  (fmod (cosh c) (log1p a)))