Random Jason Timeout Test 004

Average Error: 34.4 → 34.4

Time: 37.6s

Precision: 64

• could not determine a ground truth for program body

  1. a = -2.1933485918747662e-175
  2. c = 8.376407387530593e+265

Math

\[\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\]

↓

\[e^{\sqrt[3]{\left(\sqrt[3]{\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)} \cdot \left(\sqrt[3]{\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)} \cdot \sqrt[3]{\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right)\right) \cdot \left(\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right) \cdot \log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\right)}}\]

C

double f(double a, double c) {
        double r1222398 = c;
        double r1222399 = cosh(r1222398);
        double r1222400 = a;
        double r1222401 = log1p(r1222400);
        double r1222402 = fmod(r1222399, r1222401);
        return r1222402;
}

↓

double f(double a, double c) {
        double r1222403 = c;
        double r1222404 = cosh(r1222403);
        double r1222405 = a;
        double r1222406 = log1p(r1222405);
        double r1222407 = fmod(r1222404, r1222406);
        double r1222408 = log(r1222407);
        double r1222409 = cbrt(r1222408);
        double r1222410 = r1222409 * r1222409;
        double r1222411 = r1222409 * r1222410;
        double r1222412 = r1222408 * r1222408;
        double r1222413 = r1222411 * r1222412;
        double r1222414 = cbrt(r1222413);
        double r1222415 = exp(r1222414);
        return r1222415;
}

Error

Bits error versus a

Bits error versus c

Derivation

1. Initial program 34.4

   \[\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\]
2. Using strategy rm

3. Applied add-exp-log 34.4

   \[\leadsto \color{blue}{e^{\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}\]
4. Using strategy rm

5. Applied add-cbrt-cube 34.4

   \[\leadsto e^{\color{blue}{\sqrt[3]{\left(\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right) \cdot \log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\right) \cdot \log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}}\]
6. Using strategy rm

7. Applied add-cube-cbrt 34.4

   \[\leadsto e^{\sqrt[3]{\left(\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right) \cdot \log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\right) \cdot \color{blue}{\left(\left(\sqrt[3]{\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)} \cdot \sqrt[3]{\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right) \cdot \sqrt[3]{\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right)}}}\]

8. Final simplification 34.4

   \[\leadsto e^{\sqrt[3]{\left(\sqrt[3]{\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)} \cdot \left(\sqrt[3]{\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)} \cdot \sqrt[3]{\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right)\right) \cdot \left(\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right) \cdot \log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\right)}}\]

Reproduce

herbie shell --seed 2019169 
(FPCore (a c)
  :name "Random Jason Timeout Test 004"
  (fmod (cosh c) (log1p a)))