Average Error: 0.0 → 0.0
Time: 1.1s
Precision: 64
\[-\log \left(\frac{1}{x} - 1\right)\]
↓
\[-\log \left(\frac{1}{x} - 1\right)\]
-\log \left(\frac{1}{x} - 1\right)
↓
-\log \left(\frac{1}{x} - 1\right)
double f(double x) {
        double r1898 = 1.0;
        double r1899 = x;
        double r1900 = r1898 / r1899;
        double r1901 = r1900 - r1898;
        double r1902 = log(r1901);
        double r1903 = -r1902;
        return r1903;
}
↓
double f(double x) {
        double r1904 = 1.0;
        double r1905 = x;
        double r1906 = r1904 / r1905;
        double r1907 = r1906 - r1904;
        double r1908 = log(r1907);
        double r1909 = -r1908;
        return r1909;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[-\log \left(\frac{1}{x} - 1\right)\]

  2. Final simplification0.0

    \[\leadsto -\log \left(\frac{1}{x} - 1\right)\]

Reproduce

herbie shell --seed 2020056 +o rules:numerics
(FPCore (x)
  :name "neg log"
  :precision binary64
  (- (log (- (/ 1 x) 1))))