Average Error: 0.0 → 0.0
Time: 6.0s
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 r8985 = 1.0;
        double r8986 = x;
        double r8987 = r8985 / r8986;
        double r8988 = r8987 - r8985;
        double r8989 = log(r8988);
        double r8990 = -r8989;
        return r8990;
}
↓
double f(double x) {
        double r8991 = 1.0;
        double r8992 = x;
        double r8993 = r8991 / r8992;
        double r8994 = r8993 - r8991;
        double r8995 = log(r8994);
        double r8996 = -r8995;
        return r8996;
}

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 2019306 +o rules:numerics
(FPCore (x)
  :name "neg log"
  :precision binary64
  (- (log (- (/ 1 x) 1))))