Random Jason Timeout Test 004

Average Error: 33.9 → 33.9

Time: 14.0s

Precision: 64

• could not determine a ground truth for program body

  1. a = 2.182169612233222e+173
  2. c = -1.497073903866961e+55

Math

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

↓

\[e^{\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]{\sqrt[3]{{\left(\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\right)}^{3}}}}\]

C

double f(double a, double c) {
        double r11332 = c;
        double r11333 = cosh(r11332);
        double r11334 = a;
        double r11335 = log1p(r11334);
        double r11336 = fmod(r11333, r11335);
        return r11336;
}

↓

double f(double a, double c) {
        double r11337 = c;
        double r11338 = cosh(r11337);
        double r11339 = a;
        double r11340 = log1p(r11339);
        double r11341 = fmod(r11338, r11340);
        double r11342 = log(r11341);
        double r11343 = cbrt(r11342);
        double r11344 = r11343 * r11343;
        double r11345 = 3.0;
        double r11346 = pow(r11342, r11345);
        double r11347 = cbrt(r11346);
        double r11348 = cbrt(r11347);
        double r11349 = r11344 * r11348;
        double r11350 = exp(r11349);
        return r11350;
}

Error

Bits error versus a

Bits error versus c

Derivation

1. Initial program 33.9

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

3. Applied add-exp-log 33.9

   \[\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-cube-cbrt 33.9

   \[\leadsto e^{\color{blue}{\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)}}}\]
6. Using strategy rm

7. Applied add-cbrt-cube 33.9

   \[\leadsto e^{\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]{\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)}}}}\]

8. Simplified 33.9

   \[\leadsto e^{\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]{\sqrt[3]{\color{blue}{{\left(\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\right)}^{3}}}}}\]

9. Final simplification 33.9

   \[\leadsto e^{\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]{\sqrt[3]{{\left(\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\right)}^{3}}}}\]

Reproduce

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